import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Solution {
	static CombNumbers combNumb = new CombNumbers();
	static int mod = 1_000_000_007;
	
    public static void main(String[] args) throws FileNotFoundException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();
        String s = sc.next();
        int[] chars = new int[s.length()];
        for(int i=0; i<s.length(); i++) chars[i] = s.charAt(i) % 26;
        
        int type;
        int start;
        int end;
        int t=0;
        for(int a0 = 0; a0 < q; a0++){
            type = sc.nextInt();
            start = sc.nextInt();
            end = sc.nextInt();
            if(type==1) {
                t=sc.nextInt();
                update(chars,start,end,t%26);
            } else {
                output(chars,start,end);
            }    
        }
    }
    
    private static void output(int[] chars, int start, int end){
   	 long[][] dp;
	      int[] occur = new int[26];
	       int length = end-start+1;
	       for(int i=start; i<=end; i++) occur[chars[i]]++;
	       
	       dp = new long[26][length+1];
	       for(int i=0; i<=occur[0]; i++){
	      	 dp[0][i] = combNumb.combNumber(occur[0], i, mod);
	       }
	       
	       for(int i=1; i<26; i++){
	      	 dp[i][0]=1;
	      	 dp[i][1]=dp[i-1][1]+occur[i];
	       }
	       
	       for(int row = 1; row<26; row++){
	      	 if(occur[row]==0) {
	      		 dp[row] = dp[row-1];
	      		 continue;
	      	 }
	      	 for(int col=2; col<=length; col++){
	      		 for(int prev=Math.max(0, col-occur[row]); prev<=col; prev++){
	      			 if(col%2==1 || prev%2==0){
	      				 dp[row][col]=(dp[row][col]+dp[row-1][prev]*combNumb.combNumber(occur[row], col-prev, mod))%mod;
	      			 }
	      		 }
	      	 }
	       }
	       
	       long res = (sum(dp[25])-1 +mod) % mod;
	   	 
	   	 System.out.println(res);
   	 
   	 
    }
    
    private static long sum(long[] a){
   	 long res = 0;
   	 for (int i = 0; i < a.length; i++) {
   		 res+=a[i];
   	 }
   	 
   	 return res;
    }
    
    private static void update(int[] chars, int start, int end, int value){
   	 for(int i=start; i<=end; i++) chars[i] = (chars[i]+value)%26;
    }
}

class CombNumbers {
	long[] factorials;
	
	/**
	 * Use for repetitive calls and top<10^6.
	 * O(log mod)
	 */
	public long combNumber(int top, int bottom, int mod){
		if(factorials==null) factorials = factorials(1_000_000, mod);
		if(2*bottom>top) bottom = top-bottom;
		return factorials[top] * inverse(factorials[bottom]*factorials[top-bottom]%mod, mod) % mod;
	}
	
	/**
	 * Use to calculate single combinatorial number or when when top>10^7.
	 */
//	public long combNumber(long top, long bottom, int mod) {
//		if(2*bottom>top) bottom = top-bottom;
//		
//		long topProd = 1;
//		long bottomProd = 1;
//		for(int i=1; i<=bottom; i++){
//			topProd = (topProd * (top+1-i)) % mod;
//			bottomProd = (bottomProd * i) % mod;
//		}
//		return topProd * inverse(bottomProd, mod) % mod;
//	}
	
	private static long inverse(long number, int prime){
		return power(number, prime-2, prime);
	}
	
	private static long power(long base, long exp, int mod){
		if(exp==0) return 1;
		long result = 1;
		
		while(exp > 0){
			if(exp%2==0) {
				base = (base*base)%mod;
				exp /= 2;
			} else {
				exp--;
				result = (result*base)%mod;
			}
		}
		
     return result;
	}

	public static long[] factorials(int max, int mod){
        long[] fact = new long[max+1];
        fact[0] = 1;
        for(int i=1; i<=max; i++) fact[i] = (fact[i-1]*i) %mod;
        
        return fact;
    }
	
}