PIVO_YAVNOYE

#include<bits/stdc++.h>

#define loop(x, n) for(ll i = x; i < n; i++ )
#define pb push_back
#define MOD ll(1e9+7)
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define DEBUG 1
typedef long long ll;
using namespace std;
int next(int n, int k){
    return (n+k)%26;
}

///
struct Node{
    int prior, size = 1;
    int key;
    Node *l = 0, *r = 0;
    Node(int _key) {key = _key, prior = rand();}
};
///

typedef pair<Node*, Node*> Pair;

int size(Node *v){return v ? v->size : 0;}
void upd(Node *v){v->size = size(v->l) + size(v->r) + 1;}


Node *merge(Node *l, Node *r){

    if(!l) return r;
    if(!r) return l;
    cout << "merge\n";
//    cout << l->size << " " <<r->size << "\n";
    if(l->prior > r->prior){
        l->r = merge(l->r, r);
        upd(l);
        return l;
    }else{
        r->l = merge(l, r->l);
        upd(r);
        return r;
    }
}

Pair split(Node *p, int x) {
    if (!p) return {0, 0};
    if (p->key <= x) {
        Pair q = split(p->r, x);
        p->r = q.first;
        return {p, q.second};
    }
    else {
        Pair q = split(p->l, x);
        p->l = q.second;
        return {q.first, p};
    }
}

//Node *root = 0;
Node* insert(Node *root, int x) {
    Pair q= split(root, x);
    Node *t = new Node(x);
//    cout << q.f << " " << q.s << "\n";
    root = merge(q.first, merge(t, q.second ));
//    cout <<root->size <<"\n";
    return root;
}
///////
///////


Node* ctrlx (Node *root, int l, int r) {
    Pair q1 = split(root, r);
    Pair q2 = split(q1.first, l);

    root = merge(q2.first, q1.second);
    return q2.second;
}

void ctrlv (Node *root, Node *v, int k) {
    Pair q = split(root, k);
    root = merge(q.first, merge(v, q.second));

}


///////
///////

//vector<Node*> abc(26);
Node* abc[26];
void solve(){
    int n, m;
    cin >> n >> m;
    string a;
    cin >> a;
    ///построить дд /// nlogn


//    loop(0, n){
////        Node q1 = insert(*abc[a[i]-'a'], i);
////        if(abc[a[i]-'a'] == 0){
////
////        }
//        abc[a[i]-'a'] = insert(abc[a[i]-'a'], i);
//
////        cout << abc[a[i]-'a'] << " " << abc[a[i]-'a']->size <<" ";
////        abc[a[i]-'a'] = &q1;
//        cout <<"loop- "<< abc[a[i]-'a']->size <<" " << abc[a[i]-'a'] << " " << abc[a[i]-'a']->l << " " << abc[a[i]-'a']->r<<"\n";
//
//
//    }


    loop(0, m){
        int q;
        cin >> q;
        if(q == 1){
            //next
            int r, l, k;
            cin >> l >> r >> k;
            Node *v;
            loop(0, 26){
                v = ctrlx(abc[i], l, r);
                ctrlv(abc[(i+1)%26], v, l);

            }

        }else{
            // f(l, r)
            int l, r;
            cin >> l >> r;
            loop(0, 26){
                Pair qr = split(abc[i], r);
                Pair ql = split(qr.first, l);
                cout << ql.first;
            }

        }
    }

}

int main() {
#ifdef DEBUG
    freopen("text.txt", "r", stdin);
    cout <<"DEBUG" <<"\n";
#else
#endif
//    int t;
//    cin >> t;
//    loop(0, t) {
//        solve();
////    cout<< solve_all("ananas");
//
//    }
    solve();
//    int n;
//    cin >> n;
//    cout << n;
    return 0;


}