#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int count_palim(int i,int j,string s)
    {
    int count=0;
    for(int k = i;k<=j;k++)
        {
        count = (count+1)%1000000007;
        int t1=k-1,t2=k+1;
        while(t1>=i&&t2<=j)
            {
            if(s[t1]==s[t2])count = (count+1)%1000000007;
            else break;
            t1--;
            t2++;
        }
        t1=k,t2=k+1;
        while(t1>=i&&t2<=j)
            {
            if(s[t1]==s[t2])count = (count+1)%1000000007;
            else break;
            t1--;
            t2++;
        }
       //cout<<count<<" ";
    }
    return count%1000000007;
}

int main(){
    int n;
    int q;
    string letters = "abcdefghijklmnopqrstuvwxyz";
    cin >> n >> q;
    string s;
    cin >> s;
    for(int a0 = 0; a0 < q; a0++){
        int type,i,j,t;
        cin>>type;
        if(type==1)cin>>i>>j>>t;
        else cin>>i>>j;
        if(type==2)
            {
            cout<<count_palim(i,j,s)<<endl;
        }
        else
            {
            for(int k=i;k<=j;k++)
                {
                int p = (int)s[k]-96+t;
                p=p%26;
                s[k]=letters[p-1];
            }
            //cout<<s;
        }
    }
    return 0;
}