#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,i,j,t,k,h;
    int q;
    cin >> n >> q;
    string s;
    cin >> s;
    for(int a0 = 0; a0 < q; a0++){
        // your code goes here
        cin>>i>>j>>t;
        for(k=i;k<=j;k++)
            {
            if(s[k]+t<='z')
                s[k]+=t;
            else
                {
                h='z'-s[k];
                s[k]='a'+t-h-1;
            }
        }
    }
    cout<<s;
    return 0;
}