import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
       public static  char inc(char x) {
           if(x=='z') {
               x='a';
           }
          else { 
           x=(char)((int)x+1);
          }    
           return x; 
       }
      
    
        static boolean pall(String org) { 
            int length = org.length();
            boolean ret=false;
            String reverse="";
          if(length>=2) {  
      for ( int i = length - 1; i >= 0; i-- )
         reverse = reverse + org.charAt(i);
 
      if (org.equals(reverse)) ret= true;
          }
         else if(length==1) {
             ret=true;
         }   
              //  System.out.println("Entered string is a palindrome.");
        return ret;
     }
    
    public static Set<String> permutationFinder(String str) {
        Set<String> perm = new HashSet<String>();
        //Handling error scenarios
        if (str == null) {
            return null;
        } else if (str.length() == 0) {
            perm.add("");
            return perm;
        }
        char initial = str.charAt(0); // first character
        String rem = str.substring(1); // Full string without first character
        Set<String> words = permutationFinder(rem);
        for (String strNew : words) {
            for (int i = 0;i<=strNew.length();i++){
                perm.add(charInsert(strNew, initial, i));
            }
        }
        return perm;
    }

    public static String charInsert(String str, char c, int j) {
        String begin = str.substring(0, j);
        String end = str.substring(j);
        return begin + c + end;
    }

    
   static  ArrayList<ArrayList<Character>> list;
      static void printSubsets(char set[]) {
                int n = set.length;
        list=new  ArrayList<ArrayList<Character>>();
        // Run a loop for printing all 2^n
        // subsets one by obe
          int count=0;
        for (int i = 0; i < (1<<n); i++) {
           // System.out.print("{ ");
             ArrayList<Character> a1=new ArrayList<Character>();
            // Print current subset
            for (int j = 0; j < n; j++){
 
                // (1<<j) is a number with jth bit 1
                // so when we 'and' them with the
                // subset number we get which numbers
                // are present in the subset and which
                // are not
                if ((i & (1 << j)) > 0) {
                    //System.out.print(set[j] + " ");
                   a1.add(set[j]);
              }
        }
            int len=a1.size();
            char[] ch=new char[len];
            for(int u=0;u<len;u++) {
                ch[u]=a1.get(u);
            }
            String st=new String(ch);
            if(pall(st)) {
                count+=1;
            }
            else {
             Set<String> s3=permutationFinder(st);
                         Iterator<String>   it1=   s3.iterator();
                      while(it1.hasNext()) {
                              String sq=it1.next();
                            if(pall(sq)) {
                                   count+=1;
                                   break;    
                            }
                      }
            }
            
            //System.out.println("}");
        }
        System.out.println(count);  
    }
    public static void main(String[] args) throws Exception{
        //Scanner in = new Scanner(System.in);
        BufferedReader ip=new BufferedReader(new InputStreamReader(System.in));
        String line=ip.readLine();
        String[] ars=line.split("\\s+");
        int n = Integer.parseInt(ars[0]);
        int q = Integer.parseInt(ars[1]);
        String s1 = ip.readLine();
        int[] a1;
        for(int a0 = 0; a0 < q; a0++){
            // your code goes here
          String   s = ip.readLine();
            //System.out.println(s);
           String[] ar=s.split("\\s+");
           a1=new int[ar.length];
            for(int i=0;i<ar.length;i++) {
                    int te=Integer.parseInt(ar[i]);
                   //  System.out.println(te);
                    a1[i]=te; 
            }
            if(a1[0]==1) {
                 int i=a1[1];
                 int j=a1[2];
                j=j+1;
                  // System.out.println(i+" "+j);
                int t=a1[3];
                String sub=s1.substring(i,j);
                char[] ar1=sub.toCharArray();
               for(int q2=0;q2<ar1.length;q2++) {
                   char f=ar1[q2];
                  // System.out.println(" int: "+f);
                   for(int iq=0;iq<t;iq++) {
                       f=inc(f);
                  }
                  // System.out.println(f);
                  ar1[q2]=f; 
               }
                 char[] ar2=s1.toCharArray();
                j=j-1;
              for(int l=i;l<=j;l++) {
                   ar2[l]=ar1[l]; 
              }  
              s1=new String(ar2);  
                //System.out.println(s1);
            }
            else if(a1[0]==2) {
                int i=a1[1];
                int j=a1[2];
                j=j+1;
                 //System.out.println(i+" "+j);
                String sub=s1.substring(i,j);
              //  System.out.println(sub);
                char[] ar3=sub.toCharArray();
                printSubsets(ar3);
                
            }
        }
    }
}