#include <bits/stdc++.h>
using namespace std;
const int N=100000+5;
int n,m;
char s[N];
int main(){
    freopen ("Carillon.in","r",stdin);
    freopen ("Carillon.out","w",stdout);
    scanf("%d%d",&n,&m);
    scanf("%s",s+1);
    for (int i=1;i<=m;i++){
        int ty=0,l,r;
        char t;
        scanf("%d",&ty);
        if (ty==1){
            scanf("%d%d",&l,&r);
            cin>>t;
            for (int j=l;j<=r;j++)s[j]=t;
        }
        else{
            scanf("%d%d",&l,&r);
            sort(s+l,s+r+1);
        }
    }
    for (int i=1;i<=n;i++){
        cout<<s[i];
    }
    return 0;
}