#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;
long long countPS(string str)
{
    int N = str.length();
    long long cps[N+1][N+1];
    memset(cps, 0 ,sizeof(cps));
 
    for (int i=0; i<N; i++)
        cps[i][i] = 1;
    for (int L=2; L<=N; L++)
    {
        for (int i=0; i<N; i++)
        {
            int k = L+i-1;
            if (str[i] == str[k])
                cps[i][k] = cps[i][k-1] +
                            cps[i+1][k] + 1;
            else
                cps[i][k] = cps[i][k-1] +
                            cps[i+1][k] -
                            cps[i+1][k-1];
        }
    }
    return cps[0][N-1];
}

int main(){
    int n;
    int q;
    cin >> n >> q;
    string s;
    cin >> s;
    int a,b,c,d;
    for(int a0 = 0; a0 < q; a0++){
        // your code goes here
        cin>>a>>b>>c;
        if(a==1){
            cin>>d;
            for(int i=b;i<=c;i++){
                s[i]+=(d%26);
            }
        }
        else{
            cout<<countPS(s.substr(b,c-b+1))%1000000007<<endl;
        }
        
    }
    return 0;
}