1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include <bits/stdc++.h>
#pragma gcc optimize("O2")
#pragma g++ optimize("O2")
#define int long long
#define endl 'n'
using namespace std;

const int N = 2e2 + 10, MOD = 1e9 + 7;

string s;

char ans[N];

namespace SegTree{
    #define ls rt << 1
    #define rs rt << 1 | 1
    #define lson ls, id, l, mid
    #define rson rs, id, mid + 1, r

    int tree[N << 2][26], lazy[N << 2][26];

    inline void push_up(int rt, int id){ tree[rt][id] = tree[ls][id] + tree[rs][id]; }

    inline void push_down(int rt, int id, int m){
        if(lazy[rt][id] == -1) return;
        lazy[ls][id] = lazy[rs][id] = lazy[rt][id];
        tree[ls][id] = lazy[rt][id] * (m - (m >> 1));
        tree[rs][id] = lazy[rt][id] * (m >> 1);
        lazy[rt][id] = -1;
    }
    void build(int rt, int id, int l, int r){
        lazy[rt][id] = -1, tree[rt][id] = 0;
        if(l == r){
            tree[rt][id] += (s[l] - 'a' == id);
            return;
        }
        int mid = l + r >> 1;
        build(lson), build(rson);
        push_up(rt, id);
    }

    void update(int rt, int id, int l, int r, int L, int R, int val){
        if(l >= L && r <= R){
            tree[rt][id] = val * (r - l + 1);
            lazy[rt][id] = val;
            return;
        }
        push_down(rt, id, r - l + 1);
        int mid = l + r >> 1;
        if(mid >= L) update(lson, L, R, val);
        if(mid < R) update(rson, L, R, val);
        push_up(rt, id);
    }

    int query(int rt, int id, int l, int r, int L, int R){
        if(l >= L && r <= R) return tree[rt][id];
        push_down(rt, id, r - l + 1);
        int mid = l + r >> 1, ans = 0;
        if(mid >= L) ans += query(lson, L, R);
        if(mid < R) ans += query(rson, L, R);
        return ans;
    }

    void getans(int rt, int id, int l, int r){
        if(l == r){
            if(tree[rt][id]) ans[l] = (char)('a' + id);
            return;
        }
        push_down(rt, id, r - l + 1);
        int mid = l + r >> 1;
        getans(lson), getans(rson);
    }
}


inline void solve(){
    int n, q; cin >> n >> q;
    cin >> s, s = '@' + s;
    for(int i = 0; i < 26; i++) SegTree::build(1, i, 1, n);
    while(q--){
        int l, r, k; cin >> l >> r >> k;
        vector<int> cnt;
        for(int i = 0; i < 26; i++) cnt.emplace_back(SegTree::query(1, i, 1, n, l, r));
        if(k){
            int curl = l, curr = l;
            for(int i = 0; i < 26; i++){
                if(!cnt[i]) continue;
                curr = curl + cnt[i] - 1;
                SegTree::update(1, i, 1, n, l, r, 0);
                SegTree::update(1, i, 1, n, curl, curr, 1);
                curl = curr + 1;
            }
            assert(curr == r);
        } else {
            int curl = l, curr = l;
            for(int i = 25; i >= 0; i--){
                if(!cnt[i]) continue;
                curr = curl + cnt[i] - 1;
                SegTree::update(1, i, 1, n, l, r, 0);
                SegTree::update(1, i, 1, n, curl, curr, 1);
                curl = curr + 1;
            }
            assert(curr == r);
        }
    }
    for(int i = 0; i < 26; i++) SegTree::getans(1, i, 1, n);
    for(int i = 1; i <= n; i++) cout << ans[i];
    cout << endl;
}

signed main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout << fixed << setprecision(12);
    int t = 1; //cin >> t;
    while(t--) solve();
    return 0;
}