#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>
typedef unsigned long long ull;
using namespace std;
const int md=1e9+7;
/*ull palindromeSubStrs(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;
        }
    }
    s = s.substr(1, n);
 
    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--)
               m[s.substr(i - rp - 1, 2 * rp + j)]+=1;
        m[string(1, s[i])]+=1;
    }

    ull cc=0;
   map<string, int>::iterator ii;
   for (ii = m.begin(); ii!=m.end(); ++ii)
     {cc+=((ii)->second%md);
     cout<<"> "<<ii->first<<"<"<<(ii)->second<<endl;
     }
    
    
    return cc;
}*/
ull Set(string set)
{
    ull l=1;
    ull pow_set_size = l<<(set.length());
    int counter, j;
 
    ull c=0;
    for(counter = 1; counter < pow_set_size; counter++)
    {string ss,ssr;
      for(j = 0; j < set.length(); j++)
       {
          
          if(counter & (1<<j))
            ss+=set[j];
       }
     
     
     ssr=ss;
      reverse(ss.begin(),ss.end());
     //cout<<ss<<" "<<ssr;
     //cout<<ss.compare(ssr)<<endl;
     if(ss.compare(ssr)==0)
         c+=1%md;
    }
    return c;

}
int main() {
    int n,q;
    cin>>n>>q;
    string str;
    cin>>str;
    while(q--)
        {   int a,b,c;
            cin>>a>>b>>c;
               if(a==1)
                   {
                       int t;
                       cin>>t;
                       for(int i=b;i<=c;i++)
                            str[i]=(str[i]+t)%122;
                   //cout<<str;
                   }
               else
                 {
                   cout<<Set(str.substr(b,c+1));
                    cout<<endl;
                 }
        
       
    }
    
  
    return 0;
}