#include <bits/stdc++.h>
using namespace std;
#define pii             pair<int , int >
#define inf             1111111111
#define in(a)           scanf("%d", &a)
#define ins(a)          scanf("%s", a)
#define in2(a, b)       scanf("%d%d", &a, &b)
#define in3(a, b, c)    scanf("%d%d%d", &a, &b, &c)
#define mp              make_pair
#define vi              vector<int >
#define _ceil(n, a)     ((n)%(a)==0?((n)/(a)):((n)/(a)+1))
#define cl              clear()
#define sz              size()
#define pn              printf("\n")
#define pr(a)           printf("%d\n", a)
#define prs(a)          printf("%d ", a)
#define pr2(a, b)       printf("%d %d\n", a, b)
#define pr3(a, b, c)    printf("%d %d %d\n", a, b, c)
#define pb              push_back
#define mem(a, b)       memset((a), (b), sizeof(a))
#define all(X)          (X).begin(), (X).end ()
#define iter(it, X)     for (__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)
#define ext(a)          {printf("%s\n", a); return 0;}
#define oka(x, y)       ((x)>=0&&(x)<row&&(y)>=0&&(y)<col)
#define x               first
#define y               second
#define lc              (2*i)
#define rc              (2*i+1)
#define sst             clock_t t = clock()
#define eed             printf ("It took me %d clicks.\n", (int)(clock() - t))

#define prr(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); pn;}
vector<string> split(const string& s, char c) {
	vector<string> v;
	stringstream ss(s);
	string x;
	while (getline(ss, x, c))
		v.emplace_back(x);
	return move(v);
}
void err(vector<string>::iterator it) {}
template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
	cerr <<a<<" ";
	err(++it, args...);
}

typedef long long LL;
//int  dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int  dx[]={1,1,0,-1,-1,-1,0,1,0};int dy[]={0,1,1,1,0,-1,-1,-1,0};//8 direction
//int  dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction
//bool check(int n, int pos) {return (n & (1<<pos))>>pos;} //typecast 1 in case of int
//int  on(int n, int pos) {return n | (1<<pos);} //typecast 1 in case of int
//int  off(int n, int pos) {return n & ~(1<<pos);} //typecast 1 in case of int
//bool operator < (const data &d) const{return cost<d.cost;} //reverse in priority queue

const int M = 400010, mod = 1000000007;
struct node {
    int cnt[30];
    int shift;
    node() {shift = 0, mem(cnt, 0);}
    void propagate(int t)
    {
        int temp[30];
        mem(temp, 0);
        for (int x = 0; x<26; x++) temp[(x+t)%26] = cnt[x];
        for (int x = 0; x<26; x++) cnt[x] = temp[x];
    }
};
int A[M];
int ans[M];
LL p[M];
char C[M];
node tree[M];
void build(int i, int l, int r)
{
    tree[i].shift = 0;
    if (l == r) tree[i].cnt[A[l]]++;
    else
    {
        int m = (l+r)/2;

        build(lc, l, m);
        build(rc, m+1, r);

        for (int x = 0; x<26; x++) tree[i].cnt[x] = tree[lc].cnt[x] + tree[rc].cnt[x];
    }
}
void update(int i, int l, int r, int st, int ed, int t)
{
    tree[i].shift%=26;

    if (tree[i].shift)
    {
        tree[i].propagate(tree[i].shift);
        if (lc != rc) tree[lc].shift += tree[i].shift, tree[rc].shift += tree[i].shift;
        tree[i].shift = 0;
    }

    if (l>=st && r<=ed)
    {
        tree[i].propagate(t);
        if (lc != rc) tree[lc].shift += t, tree[rc].shift += t;
    }
    else if (l>ed || r<st) return ;
    else
    {
        int m = (l+r)/2;

        update(lc, l, m, st, ed, t);
        update(rc, m+1, r, st, ed, t);

        for (int x = 0; x<26; x++) tree[i].cnt[x] = tree[lc].cnt[x] + tree[rc].cnt[x];
    }
}
void query(int i, int l, int r, int st, int ed)
{
    tree[i].shift%=26;

    if (tree[i].shift)
    {
        tree[i].propagate(tree[i].shift);
        if (lc != rc) tree[lc].shift += tree[i].shift, tree[rc].shift += tree[i].shift;
        tree[i].shift = 0;
    }

    if (l>=st && r<=ed)
    {
        for (int x = 0; x < 26; x++) ans[x] += tree[i].cnt[x];
    }
    else if (l>ed || r<st) return ;
    else
    {
        int m = (l+r)/2;

        query(lc, l, m, st, ed);
        query(rc, m+1, r, st, ed);
    }
}
LL calc()
{
    int i, j, k;
    LL sum = 1;

    for (i=0; i<26; i++) sum = (sum * p[max(ans[i]-1, 0)]) % mod;
    sum = ( sum - 1 + mod ) % mod;

    for (i=0; i<26; i++)
    {
        if (ans[i] > 0)
        {
            int temp = 1;
            for (j=0; j<26; j++) if (i!=j) temp = (temp * p[max(ans[j]-1, 0)]) % mod;

            temp = ( temp * ans[i] ) % mod;
            temp = ( temp * p[max(0, ans[i]-2)] ) % mod;

            sum += temp;
            sum %= mod;
        }
    }

    return sum;
}
int main()
{
    int n, q, i, j, k, l, r, t, typ;

    p[0]=1;
    for (i=1; i<M; i++) p[i] = (2*p[i-1])%mod;

    in2(n, q);
    ins(C);
    for (i=0; i<n; i++) A[i] = C[i] - 'a';

    build(1, 0, n-1);

    while (q--)
    {
        in(typ);
        if (typ == 1)
        {
            in3(l, r, t);
            update(1, 0, n-1, l, r, t);
        }
        else
        {
            in2(l, r);
            mem(ans, 0);
            query(1, 0, n-1, l, r);

            printf("%lld\n", calc());
        }
    }


return 0;
}