#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pl;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;
const int mod = 1000000007;
const int N = 2e5;
vi g[N];
int a[N];
int mpow(int base, int exp); 
void ipgraph(int n, int m);
void dfs(int u, int par);
ll p[N];
ll dp[30][N];
string s;
int n;
void work(){
	int i, j;
	clr(dp);
	Fo(i, 0, 26)
	Fo(j, 1, n+1) dp[i][j] = dp[i][j-1] + (s[j-1]==('a'+i));	
	
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int i,k,j,t,q,l,r;
	cin>>n>>q;
	cin>>s;
	work();
	while(q--){
		cin>>t>>l>>r;
		
		r++;
		if(t==1){
			cin>>k;
			if(n>500) continue;
			k %= 26;
			Fo(i, l, r){
				int cr = s[i]-'a';
				cr += k;
				cr %= 26;
				s[i] = cr+'a';
			}
			work();
		}
			
		if(t==2){
			ll ans = 1;
			fo(i, 26){
				ll cnt = dp[i][r]-dp[i][l];
				// cout<<char(i+'a')<<" "<<cnt<<endl;
				if(cnt)
					ans *= mpow(2, cnt-1), ans %= mod;
			}
			// cout<<ans<<endl;
			ll tem = ans;
			ans--;
			fo(i, 26){
				ll ex = 0;
				ll cnt = dp[i][r]-dp[i][l];
				if(!cnt)continue;
				ex = (tem*mpow(mpow(2, cnt-1), mod-2))%mod;
				// cout<<char(i+'a')<<" "<<ex<<endl;
				// ans += (ex+mod)%mod;
				ans += tem%mod;
				if(ans >= mod) ans -= mod;
			}
			cout<<ans<<endl;
		}
	}
	return 0;
} 

int mpow(int base, int exp) {
	base %= mod;
	int result = 1;
	while (exp > 0) {
	if (exp & 1) result = ((ll)result * base) % mod;
	base = ((ll)base * base) % mod;
	exp >>= 1;
	}
	return result;
}

void ipgraph(int n, int m){
	int i, u, v;
	while(m--){
		cin>>u>>v;
		g[u-1].pb(v-1);
		g[v-1].pb(u-1);
	}
}

void dfs(int u, int par){
for(int v:g[u]){
	if (v == par) continue;
	dfs(v, u);
}
}