#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int palindromeNum(string s)
{
	map<string, int> m;
	int n = s.size();
	int R[2][n+1];

	s = "@" + s + "#";

	for (int j = 0; j <= 1; j++)
	{
		int rp = 0;
		R[j][0] = 0;

		int i = 1;
		while (i <= n)
		{
			while (s[i - rp - 1] == s[i + j + rp])
				rp++;

			R[j][i] = rp;
			int k = 1;
			while ((R[j][i - k] != rp - k) && (k < rp))
			{
				R[j][i + k] = min(R[j][i - k],rp - k);
				k++;
			}
			rp = max(rp - k,0);
			i += k;
		}
	}


	s = s.substr(1, n);

	m[string(1, s[0])]=1;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= 1; j++)
			for (int rp = R[j][i]; rp > 0; rp--)
			m[s.substr(i - rp - 1, 2 * rp + j)]=1;
		m[string(1, s[i])]=1;
	}

    return ((m.size()-1));

}



int main(){
    int n;
    int q;
    cin >> n >> q;
    string s;
    cin >> s;
    for(int a0 = 0; a0 < q; a0++){
        // your code goes here
        int queryNum;
        cin >> queryNum;
        if(queryNum == 2){
            int i, j;
            cin >> i >> j;
            string newS = s.substr(i, (j - i + 1));
            cout << newS << endl;
            cout <<  palindromeNum(newS) << endl;
        }else if(queryNum == 1){
            int i,j,k;
            cin >> i >> j >> k;
            string newS = s.substr(i, (j - i + 1));
            for(int l = i; l <= j; l++){
                newS[l] += k; 
            }
            s.replace(i,(j - i + 1),newS);
        }
        
        
        
    }
    return 0;
}