#include<cmath>
#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
char aa[10000];
char s[10000];
int na, qa, choicea, la, ua, ta, lena, qwa;
long count;
int main() 
{
    cin>>na>>qa;
    cin>>aa;
    for(int ia = 0; ia<qa; ia++)
    {
        cin>>choicea;
        if(choicea == 1)
        {
            cin>>la>>ua>>ta;
            for(int ja = la; ja<=ua; ja++)
                aa[ja] = (aa[ja] - 97 + ta)%26 + 97;
        }
        if(choicea == 2)
        {
            cin>>la>>ua;
            for(int hu = la; hu<=ua; hu++)
                s[hu - la] = aa[hu];
            s[ua - la + 1] = '\0';
            
            int t,i,a[55][55],p,cnt,j;
            for(i=0;i<55;i++)
                for(j=0;j<55;j++)
                    a[i][j]=0;
            p=strlen(s);
            for(i=p-1;i>=0;i--)
            {
                cnt=1;
                a[i][i]=1;
                if(i+1!=p)
                {
                    if(s[i]==s[i+1])
                    {
                        cnt++;
                        a[i][i+1]=3;
                    }
                    else
                        a[i][i+1]=2;
                }
                for(j=i+2;j<p;j++)
                {
                    if(s[i]==s[j])
                    {
                        cnt++;
                        cnt+=a[i+1][j-1];
                    }
                    a[i][j]=a[i+1][j]+cnt;
                }
            }
            cout<<a[0][p-1]<<endl;
            
        }
    }
    return 0;
}