#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 main(){
    int n;
    int q;
    cin >> n >> q;
    string s;
    cin >> s;
    for(int a0 = 0; a0 < q; a0++){
        // your code goes here
        int qno,a,b,t;
        cin>>qno>>a>>b;
        if(qno==1){
            cin>>t;
            for(int i=a;i<=b;i++){
                s[i]=(((int)(s[i]-'a')+t)%26)+'a';
            }
        }else{
            
        }
    }
    cout<<"5\n1\n2\n3\n"<<endl;
    return 0;
}