/// Point-Update--Range-Query

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
class BIT{
	int sx,i,j,k;
	int res;
	int *bit;
public:
	BIT()	{
		sx=0;
	}
	BIT(int x, int *first)	{
		sx=x;
		bit=first;
	}
	void build(int x, int *first)	{
		sx=x;
		bit=first;
	}
	void update(int x, int val){
		for(i=x;i<=sx;i+=(i&-i))
			*(bit+i)+=val;
	}
	int preSum(int x){
		for(res=0,i=x;i;i-=(i&-i))
			res+=*(bit+i);
		return res;
	}
	int query(int x1, int x2){
		return preSum(x2)-preSum(x1);
	}
	void show(){
		for(i=1;i<=sx;i++)
			cout<<*(bit+i)<<" ";
		cout<<endl;
	}
};


int bits[26][1000050];
char str[100005];
ll fac[100005],g[100005],p2[100005];

ll pwr(ll x, ll n){
    ll ans=1;
    while(n){
        if(n&1)
            ans=(ans*x)%mod;
        x=(x*x)%mod;
        n>>=1;
    }
    return ans;
}

ll comp(int f[]){
    ll ans=0,val;
    int i,j,grt=0;
    for(i=0;i<26;i++){
        if(f[i]>1)grt=1;
        if(f[i]<1)
            continue;
        val=(g[f[i]]);
        //cout<<(char)(i+'a')<<" :: "<<f[i]<<" "<<g[f[i]]<<" "<<val<<" \n";
        for(j=0;j<26;j++)
           if(j!=i){
            val=(val*g[f[j]])%mod;
          //  cout<<val<<" ";
        }//cout<<(char)(i+'a')<<" :: "<<val<<"\n";
        ans+=val;
    }
    for(j=0,val=1;j<26;j++)
        val=(val*g[f[j]])%mod;
    ans+=(val-1);
    //cout<<ans<<" ::: ";
    return ans%mod;
}

int main(){
	int i,n,q,ch,x,y,val,f[26];
	cin >> n >> q >> str;
    ll tmp;
	BIT tree[26];
    for(i=0;i<26;i++)
        tree[i].build(n+10,&bits[i][0]);
    for(i=0;i<n;i++)
        tree[str[i]-'a'].update(i+1,1);
    fac[0]=fac[1]=g[0]=g[1]=p2[0]=1;p2[1]=2;
    for(i=2;i<=100000;i++){
        fac[i]=(fac[i-1]*i)%mod;
        p2[i]=(2*p2[i-1])%mod;
        g[i]=p2[i-1];
        /*if((i&1)==0){
            tmp=(pwr(fac[i/2],2*(mod-2))*fac[i])%mod;
            g[i]=(g[i]+pwr(2,mod-2)*tmp)%mod;
        }*/
    }
	while(q--){
		scanf("%d%d%d",&ch,&x,&y);
		if(ch==1){
			scanf("%d",&val);val%=26;
            if(val==0)
                continue;
			for(;x<=y;x++){
                tree[str[x]-'a'].update(x+1,-1);
                str[x]+=val;
                if(str[x]>='z')
                    str[x]-=26;
                tree[str[x]-'a'].update(x+1,1);
            }
		}
		else{
       //     cout<<str<<"\n";
            for(i=0;i<26;i++){
                f[i]=tree[i].query(x,y+1);
         //       if(f[i])cout<<(char)(i+'a')<<" : "<<f[i]<<" ";
            }
			printf("%lld\n",comp(f));
		}
	}
}