#include <bits/stdc++.h>
#define pb push_back
#define sqr(x) (x)*(x)
#define sz(a) int(a.size())
#define reset(a,b) memset(a,b,sizeof(a))
#define oo 1000000007

using namespace std;

typedef pair<int,int> pii;
typedef long long ll;

const int maxn=100007;

struct ITNode{
    int sum[26],t;
} IT[maxn*4];

int n,q;
char s[maxn];
ll p2[maxn];

void initIT(int i, int l, int r){
    reset(IT[i].sum, 0);
    IT[i].t=0;
    if(l==r){
        IT[i].sum[s[l]-'a']=1;
        return;
    }
    int mid=(l+r)/2;
    initIT(i*2,l,mid); initIT(i*2+1,mid+1,r);
    for(int x=0; x<26; ++x) IT[i].sum[x] = (IT[i*2].sum[x] + IT[i*2+1].sum[x]);
}

int tmp[26];

void lazyUpdate(int i, int l, int r){
    if(IT[i].t != 0){
        for(int x=0; x<26; ++x) tmp[(x+IT[i].t)%26] = IT[i].sum[x];
        for(int x=0; x<26; ++x) IT[i].sum[x] = tmp[x];
        if(l<r){
            IT[i*2].t = (IT[i*2].t+IT[i].t)%26;
            IT[i*2+1].t = (IT[i*2+1].t+IT[i].t)%26;
        }
        IT[i].t = 0;
    }
}

void shiftIT(int i, int l, int r, int s, int f, int v){
    lazyUpdate(i, l, r);
    if(f<l || r<s) return;
    if(s<=l && r<=f){
        IT[i].t = v;
        lazyUpdate(i, l, r);
        return;
    }
    int mid=(l+r)/2;
    shiftIT(i*2,l,mid,s,f,v); shiftIT(i*2+1,mid+1,r,s,f,v);
    for(int x=0; x<26; ++x) IT[i].sum[x] = (IT[i*2].sum[x] + IT[i*2+1].sum[x]);
}

int val[26];
void getIT(int i, int l, int r, int s, int f){
    lazyUpdate(i, l, r);
    if(f<l || r<s) return;
    if(s<=l && r<=f){
        for(int x=0; x<26; ++x) val[x] += IT[i].sum[x];
        return;
    }
    int mid=(l+r)/2;
    getIT(i*2,l,mid,s,f); getIT(i*2+1,mid+1,r,s,f);
    for(int x=0; x<26; ++x) IT[i].sum[x] = (IT[i*2].sum[x] + IT[i*2+1].sum[x]);
}

ll dp[27][2];

int query(int i, int j){
    ++i; ++j;
    reset(val, 0);
    getIT(1,1,n,i,j);
    reset(dp, 0);
    dp[0][0]=1;
    for(int i=0; i<26; ++i) for(int j=0; j<2; ++j) if(dp[i][j]){
        if(val[i]==0){
            dp[i+1][j] = dp[i][j];
        }else{
            if(j==0){
                dp[i+1][0] = (dp[i+1][0] + dp[i][j] * p2[val[i]-1])%oo;
                dp[i+1][1] = (dp[i+1][1] + dp[i][j] * p2[val[i]-1])%oo;
            }else{
                dp[i+1][1] = (dp[i+1][1] + dp[i][j] * p2[val[i]-1])%oo;
            }
        }
    }
    int res = (dp[26][0] + dp[26][1] + oo - 1)%oo;
    return res;
}

int main(){
//    freopen("input.txt","r",stdin);
    scanf("%d%d",&n,&q);
    scanf("%s",s+1);
    initIT(1,1,n);
    p2[0]=1;
    for(int i=1; i<=n; ++i) p2[i]=p2[i-1]*2%oo;

    int k,x,y,t;
    for(int i=0; i<q; ++i){
        scanf("%d%d%d",&k,&x,&y);
        if(k==1){
            scanf("%d",&t);
            shiftIT(1,1,n,x+1,y+1,t);
        }else{
            printf("%d\n",query(x,y));
        }
    }
}