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

public class Solution {

    static int count(char[] str){
        int n = str.length;
        if(str.length == 1)
            return 1;
    int[][] dp = new int[n][n];
    boolean[][] P = new boolean[n][n];

        for (int i= 0; i< n; i++)
            P[i][i] = true;
 
    for (int i=0; i<n-1; i++)
    {
        if (str[i] == str[i+1])
        {
            P[i][i+1] = true;
            dp[i][i+1] = 1 ;
        }
    }
 
    for (int gap=2 ; gap<n; gap++)
    {
        for (int i=0; i<n-gap; i++)
        {
            int j = gap + i;
 
            if (str[i] == str[j] && P[i+1][j-1] )
                P[i][j] = true;
 
            if (P[i][j] == true)
                dp[i][j] = dp[i][j-1] + dp[i+1][j] + 1 - dp[i+1][j-1];
            else
                dp[i][j] = dp[i][j-1] + dp[i+1][j] - dp[i+1][j-1];
        }
    }
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }
    return dp[0][n-1];
}
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int q = in.nextInt();
        String s = in.next();
        for(int a0 = 0; a0 < q; a0++){
            // your code goes here
            int c = in.nextInt();
            int start = in.nextInt();
            int end = in.nextInt();
            if(c == 2){
                System.out.println(count(s.substring(start, end+1).toCharArray()));
            }else{
                int t = in.nextInt();
                StringBuffer st = new StringBuffer(s);
                for(int i=start; i<=end; i++){
                    st.setCharAt(i, (char)(s.charAt(i) + t));
                }
                s = st.toString();
            }
            
        }
    }
}