#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
void querry1(char arr[],int l,int k,long long int t,char temp[])
{
    t=t%26;
    for (int i = l; i <= k; ++i)
    {
        arr[i]=temp[(arr[i]+t-'a')%26];
    }
}
bool palindrom(char arr[],int n)
{
    int i=0,j=n-1;
    while(i<j)
    {
        if(arr[i]!=arr[j])
            return false;
        i++;j--;
    }
    return true;
}
void makerSubset(int prev,int num,char arr[],char temp[],int content,int n,long long int *ans,int extra)
{
    if(num==1)
    {
        for (int i = prev; i < n; ++i)
        {
            temp[content]=arr[i];
            if(palindrom(temp,extra)==true)
                (*ans)=((*ans)+1)%1000000007 ;
        }
    }
    else
    {
        for(int i=prev ; i <= n-num ; i++ )
        {
            temp[content]=arr[i];
            makerSubset(i+1,num-1,arr,temp,content+1,n,ans,extra);
        }
    }
}
void querry2(char arr[],int l,int j)
{
    char subset[j-l+1],temp[j-l+100];
    for (int i = l; i <= j; ++i)
    {
        subset[i-l]=arr[i];
    }
    long long int ans=0;
    for (int i = 1;  i <= j-l+1 ; ++i)
    {
        makerSubset(0,i,subset,temp,0,j-l+1,&ans,i);
    }
    printf("%lli\n", ans);
}
int main(int argc, char const *argv[])
{
    int n,q;
    scanf("%d %d",&n,&q);
    char arr[n];
    char temp[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
    scanf("%s",arr);
    for (int k = 0; k < q; ++k)
    {
        int z,i,j;
        long long int t;
        scanf("%d",&z);
        switch(z)
        {
            case 1:
            scanf("%d %d %lli",&i,&j,&t);
            querry1(arr,i,j,t,temp);
            break;
            case 2:
            scanf("%d %d",&i,&j);
            querry2(arr,i,j);
            break;
        }
    }
    return 0;
}