#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#define ll long long int
#define vi vector<int>
#define all(c) c.begin(),c.end()
#define mod 1000000007

using namespace std;

int main() {
	int choice;
	int n,q;
	cin>>n>>q;
	
	string s;
	cin>>s;
	
	int str[n];
	for(int i = 0;i<n;i++){
		str[i] = s[i] - 'a' + 1;
	}
	
	
	while(q--){
		long long int ans = 1;
		cin>>choice;
		switch(choice){
			case 1: int i,j,t;
					cin>>i>>j>>t;
					for(int k = i;k<=j;k++){
					str[k] = (str[k] + t - 1)%26 + 1; 
					};
				
			case 2: cin>>i>>j;
			
				int rep[27] ={},present = 0, count = 0;
				for(int k = i;k<j;k++)
				rep[str[k]]++;
				
				for(int l = 1;l<27;l++){
					if(rep[l]==0)
					continue;
					present++;
					while(rep[l]!=1){
						ans = (ans*(rep[l]/2 + 1))%mod;
						rep[l] = 1;
					}
				}
				
				for(int l = 1;l<27;l++){
					if(rep[l]==1)
					count++;
				}
				
				ans = ((ans*count)%mod + present)%mod;
				cout<<ans+1<<endl;
		}
	}
}