#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define ARRS int(2e6+11)
#define MAX ((long long)(1e18))
#define HS1 ((long long)(1000001329))
#define HS2 ((long long)(1000001531))
#define MOD ((long long)1000000007)
#define MC ((long long)26)

ll i,j,l,k,n,m,p,c,d,mx,mn,x,y,ans,res,sum;
ll fx[ARRS];
ll sf[ARRS];
//string s,s1,s2;
//vector<ll> v[ARRS];
double tx,ty;

struct node{
    node *L,*R;
    ll x[27];
    ll shval,shep;
    node(){
        shep=0;
        shval=0;
        for(int i=0; i<26; i++)
            x[i]=0;
        //x=0;
        L=NULL;
        R=NULL;
    }
    void updt(){
        shval=0;
        for(int i=0; i<26; i++){
            x[i]=0;
            if(L!=NULL)
                x[i]+=L->x[((i-L->shval)%MC+MC)%MC];
            if(R!=NULL)
                x[i]+=R->x[((i-R->shval)%MC+MC)%MC];
        }
    }
    void shplit(){
        if(!L)L=new node();
        if(!R)R=new node();
        L->shval=(L->shval+shval)%MC;
        R->shval=(R->shval+shval)%MC;
        ll ox[27];
        for(int i=0; i<26; i++)ox[i]=x[i];
        for(int i=0; i<26; i++){
            x[i]=ox[((i-shval)%MC+MC)%MC];
        }
        shval=0;
    }
};
ll wi,wx;
void upp(ll l,ll r,node *& x){
    if(!x)x=new node();
    if(r-1<wi||wi<l)return;
    if(l==r-1){x->x[wx]=1;return;}
    upp(l,(l+r)/2,x->L);
    upp((l+r)/2,r,x->R);
    x->updt();
}
ll wl,wr;
void update(ll l,ll r,node *& x){
    if(wr<l||r-1<wl)return;
    if(wl<=l&&r-1<=wr){
        //cout<<l<<" "<<r<<endl;
        x->shval=(x->shval+wx)%MC;
        return;
    }
    if(x->shval)x->shplit();
    update(l,(l+r)/2,x->L);
    update((l+r)/2,r,x->R);
    x->updt();
}

ll sm[27];
void summ(ll l,ll r,node *& x){
    if(wr<l||r-1<wl)return;
    if(wl<=l&&r-1<=wr){
        for(int i=0; i<26; i++){
            sm[i]+=x->x[((i-x->shval)%MC+MC)%MC];
        }
        return;
    }
    if(x->shval)x->shplit();
    summ(l,(l+r)/2,x->L);
    summ((l+r)/2,r,x->R);

}
string s;
node * root;
ll f[ARRS];
int main(){
    #ifdef KHOKHO
        freopen("in.in","r",stdin);
        freopen("out.out","w+",stdout);
    #endif //KHOKHO
    //cout<<poww(5,3)<<endl;
    f[0]=1;
    for(int i=1; i<100000; i++){
        f[i]=(f[i-1]*2)%MOD;
    }
    cin>>n>>m;

    cin>>s;
    for(int i=0; i<n; i++){
        wi=i;
        wx=s[i]-'a';
        upp(0,n+1,root);
    }
    ll q;
    for(int i=0; i<m; i++){
        cin>>q;
        if(q==1){
            cin>>wl>>wr>>wx;
            update(0,n+1,root);
        } else {
            memset(sm,0,sizeof(sm));
            cin>>wl>>wr;
            summ(0,n+1,root);
           // cout<<wl<<" "<<wr<<endl;
            //for(int i=0; i<26; i++){
            //    cout<<sm[i]<<" ";
           // }
            //cout<<endl;
            ll p=1,pas=0;
            for(int i=0; i<26; i++){
                if(sm[i])
                p=(p*f[sm[i]-1])%MOD;
            }
            //cout<<"*"<<p<<endl;
            pas=p-1;
            for(int i=0;i<26; i++){
                if(!sm[i])continue;
                p=1;
                for(int j=0; j<26; j++){
                    //if(j!=i)
                        if(sm[j])p=(p*f[sm[j]-1])%MOD;
                   // else if(sm[j])p=(p*f[sm[j]-1])%MOD;
                }
               // cout<<"/"<<p<<endl;
                pas+=p;
            }
            cout<<pas%MOD<<endl;

        }
    }
    ll s1=1,s2=1;

//    dp[1]=1;
 //   for(int i=2; i<n; i++){
 //       dp[i]=(dp[i-1]*(i-1)*(n-i))%MOD;
 //       cout<<i<<" "<<dp[i]<<endl;
 //       s1+=dp[i]*i;
 //       s2+=dp[i];
 //   }
   // cout<<s1<<" "<<s2<<endl;
   // ll k=1;
   // for(int i=1; i<=n; i++){
    //    k=(k*i)%MOD;
   // }
    //cout<<((s1*poww(s2,MOD-2))%MOD*k)%MOD;
    return 0;
}