#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
bool canFormPalindrome(string str)
{
    // Create a count array and initialize all values as 0
    //int count[NO_OF_CHARS] = {0};
 vector<int>count(126,0);
    // For each character in input strings, increment count in
    // the corresponding count array
    for (int i = 0; str[i];  i++)
        count[str[i]]++;
 
    // Count odd occurring characters
    int odd = 0;
    for (int i = 0; i < 126; i++)
        if (count[i] & 1)
            odd++;
     
    // Return true if odd count is 0 or 1, otherwise false
    return (odd <= 1);
}

int palindromeSubStrs(string s)
{
    //cout<<s<<endl;
    int sum=s.size(); 
    for(int j1=2;j1<=s.size();j1++)
    {
        vector<int>vec(s.size(),0);
            int k=j1;
            for(int j=0;j<j1;j++)
            vec[j]=1;
            sort(vec.begin(),vec.end());
        do{
            string st;
            for(int i=0;i<vec.size();i++)
              if(vec[i]==1) 
            st+=s[i];
                int l=0,r=st.size()-1,flg=0;
            /*while(l<r)
                if(st[l]!=st[r]){flg=1;break;}
            else {l++;r--;}*/
            if(canFormPalindrome(st) ) sum++;
            sum=sum%1000000007;
        }while(next_permutation(vec.begin(),vec.end()));
    }
    //cout<<s<<endl;
    sum=sum%1000000007;
    return sum;
}    
/*int palindromeSubStrs1(string s)
{
    map<string, int> m;
    int n = s.size();
 
    int R[2][n+1];
    s = "@" + s + "#";
 
    for (int j = 0; j <= 1; j++)
    {
        int rp = 0;   
        R[j][0] = 0;
 
        int i = 1;
        while (i <= n)
        {
            while (s[i - rp - 1] == s[i + j + rp])
                rp++;
            R[j][i] = rp;
            int k = 1;
            while ((R[j][i - k] != rp - k) && (k < rp))
            {
                R[j][i + k] = min(R[j][i - k],rp - k);
                k++;
            }
            rp = max(rp - k,0);
            i += k;
        }
    }
 
    // remove 'guards'
    s = s.substr(1, n);
 
    // Put all obtained palindromes in a hash map to
    // find only distinct palindromess
    int sum=0;
    m[string(1, s[0])]=1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= 1; j++)
            for (int rp = R[j][i]; rp > 0; rp--){
            if(m.find(s.substr(i - rp - 1, 2 * rp + j))!=m.end() )
                 sum++;
               m[s.substr(i - rp - 1, 2 * rp + j)]=1;
           
        }
        if(m.find(string(1, s[i]))!=m.end()) sum++;
        m[string(1, s[i])]=1;
    }
 
    //printing all distinct palindromes from hash map
   // if(sum>0) sum++;
    //return sum+m.size()-1;
   return m.size()-1;
}*/

int main() {
    int n,Q;
    cin>>n>>Q;
    string st;cin>>st;
    for(int i1=0;i1<Q;i1++)
    {
        string s;
        int x,i,j,t;
        cin>>x;
        if(x==1)
        {
            cin>>i>>j>>t;
            char a;
            for(int k=i;k<=j;k++)
            {
                a=st[k];
                a=(a+t)%(123);
                st[k]=a;
            }    
            //cout<<st<<endl;
            //cout<<palindromeSubStrs(st)<<endl;
        }   
        else{
            cin>>i>>j;
            for(int k=i;k<=j;k++)
                s+=st[k];
            cout<<palindromeSubStrs(s)<<endl;
        }
    }    
    return 0;
}