#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>
#define ll long long int
#define M 1000000007

using namespace std;

ll cont = 0;

char getChar(char c,int t){
    if(c+t<='z')
        return c+t;
    else
        return 'a'+t-('z'-c+1);
}

bool isPalindromic(string s){
    int cnt[26]={0};
    for(int i=0;i<s.size();i++)
        cnt[s[i]-'a']++;
    bool hasOddOccured = false;
    for(int i=0;i<26;i++){
        if(cnt[i]%2 == 1){
            if(hasOddOccured == true)
                return false;
            else
                hasOddOccured = true;
        }
    }
    return true;
}

void getSubsets(string s,int n,int i,int j, int curInd, string curStr){
       if(curInd == j+1){
           //cout<<".... "<<curStr<<endl;
           if(isPalindromic(curStr)){
               cont = (cont+1)%M;
               //cout<<"Yes palinro"<<endl;
           }
               
       }else{
           getSubsets(s,n,i,j,curInd+1,curStr+s[curInd]);   //take it
           getSubsets(s,n,i,j,curInd+1,curStr);             //don't take
       }
}

int main(){
    /*cout<<getChar('a',25)<<endl;
    
    cout<<getChar('y',1)<<endl;
    cout<<getChar('y',2)<<endl;
    cout<<getChar('y',3)<<endl;
    cout<<getChar('y',4)<<endl;
    cout<<getChar('y',5)<<endl;*/
    
    int n;
    int q,i,j,t;
    cin >> n >> q;
    string s;
    cin >> s;
    int type;
    for(int a0 = 0; a0 < q; a0++){
        // your code goes here
        cin>>type;
        if(type == 1){
            cin>>i>>j>>t;
            t = t%26;
            for(int l=i;l<=j;l++){
                s[l]=getChar(s[l],t);
            }
        }else{
            cin>>i>>j;
            cont=0;
            getSubsets(s,n,i,j,i,"");
            cout<<(cont-1)%M<<endl;     //reducing 1 for empty subset
        }
    }
    return 0;
}