//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

ll pwr(ll base, ll p, ll mod = MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}


ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}


int n, BLOCK, cnt[340][26], block_add[340], arr[100005];
ll powers[100005];
char str[100005];



inline int block(int pos){
	return (pos-1)/BLOCK;
}


inline void update(int l, int r, int t){

	if(t == 0)	return;

	int b1 = block(l), b2 = block(r);
	if(b1 == b2){
		for(int i=l;i<=r;i++){
			cnt[b1][arr[i]]--;
			arr[i] += t;
			if(arr[i] >= 26)	arr[i] -= 26;
			cnt[b1][arr[i]]++;
		}
		return;
	}


	for(int i=l;i<=n&&block(i)==b1;i++){
		cnt[b1][arr[i]]--;
		arr[i] += t;
		if(arr[i] >= 26)	arr[i] -= 26;
		cnt[b1][arr[i]]++;
	}

	for(int b=b1+1;b<=b2-1;b++){
		block_add[b] += t;
		if(block_add[b] >= 26)	block_add[b] -= 26;
	}

	for(int i=r;i>=1&&block(i)==b2;i--){
		cnt[b2][arr[i]]--;
		arr[i] += t;
		if(arr[i] >= 26)	arr[i] -= 26;
		cnt[b2][arr[i]]++;
	}
}


inline int query(int l, int r, int val){

	int b1 = block(l), b2 = block(r);
	if(b1 == b2){
		int ans = 0;
		for(int i=l;i<=r;i++){
			int actual = arr[i] + block_add[b1];
			if(actual >= 26)	actual -= 26;
			ans += (actual == val);
		}
		return ans;
	}

	int ans = 0;
	for(int i=l;i<=n&&block(i)==b1;i++){
		int actual = arr[i] + block_add[b1];
		if(actual >= 26)	actual -= 26;
		ans += (actual == val);
	}

	for(int b=b1+1;b<=b2-1;b++){
		int needed = val - block_add[b];
		if(needed < 0)	needed += 26;
		ans += cnt[b][needed];
	}

	for(int i=r;i>=1&&block(i)==b2;i--){
		int actual = arr[i] + block_add[b2];
		if(actual >= 26)	actual -= 26;
		ans += (actual == val);
	}

	return ans;
}


int cnt2[100005][26];

inline ll query2(int l, int r){

	ll even = 1;
	vector<int> cnt (26);
	for(int i=0;i<26;i++){
		cnt[i] = ::cnt2[r][i] - ::cnt2[l-1][i];
		ll even_here = 1;
		if(cnt[i] > 0)	even_here = powers[cnt[i]-1];
		even = (even * even_here) % MOD;
	}

// cout<<"cnt: ";for(auto it : cnt)	cout<<it<<" ";cout<<endl;
// cout<<"even = "<<even<<endl;

	ll ans = even-1;
	for(int i=0;i<26;i++){
		ll even_here = 1, odd_here = 0;
		if(cnt[i] > 0){
			even_here = odd_here = powers[cnt[i]-1];
		}
		ll temp = odd_here;
		temp *= (even * pwr(even_here, MOD-2)) % MOD;
		temp %= MOD;
		ans += temp;
		ans %= MOD;
	}

	ans %= MOD;
	ans += MOD;
	ans %= MOD;
	return ans;
}


int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    powers[0] = 1;
    for(int i=1;i<=100000;i++)
    	powers[i] = (powers[i-1] * 2) % MOD;

   	int q;
   	cin>>n>>q;
   	BLOCK = ceil(sqrt(n));
   	cin>>(str+1);
   	for(int i=1;i<=n;i++){
   		arr[i] = str[i]-'a';

   		for(int j=0;j<26;j++)
   			cnt2[i][j] = cnt2[i-1][j];
   		cnt2[i][str[i]-'a']++;
   		
   		cnt[block(i)][str[i]-'a']++;
   	}

   	vector<int> cnt (26);
// q=1;
   	int type1 = 0;
   	while(q--){

   		int op;
   		cin>>op;

   		if(op == 1){

   			type1++;
   			int l, r, t;
   			cin>>l>>r>>t;
   			t %= 26;
   			l++;	r++;

   			update(l, r, t);
   		}
   		else{

   			int l, r;
   			cin>>l>>r;
   			l++;	r++;

   			if(type1 == 0){
   				cout<<query2(l, r)<<endl;
   				continue;
   			}

   			ll even = 1;
   			for(int i=0;i<26;i++){
   				cnt[i] = query(l, r, i);
   				ll even_here = 1;
   				if(cnt[i] > 0)	even_here = powers[cnt[i]-1];
   				even = (even * even_here) % MOD;
   			}

// cout<<"cnt: ";for(auto it : cnt)	cout<<it<<" ";cout<<endl;
// cout<<"even = "<<even<<endl;

   			ll ans = even-1;
   			for(int i=0;i<26;i++){
   				ll even_here = 1, odd_here = 0;
   				if(cnt[i] > 0){
   					even_here = odd_here = powers[cnt[i]-1];
   				}
   				ll temp = odd_here;
   				temp *= (even * pwr(even_here, MOD-2)) % MOD;
   				temp %= MOD;
   				ans += temp;
   				ans %= MOD;
   			}

   			ans %= MOD;
   			ans += MOD;
   			ans %= MOD;
   			cout<<ans<<endl;
   		}
   	}

    return 0;
}