A Simple Task

时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld

题目描述

This task is very simple. Given a string S of length n and q queries each query is on the format ijk which means sort the substring consisting of the characters from i to j in non-decreasing order if k = 1 or in non-increasing order if k = 0.

Output the final string after applying the queries.

输入描述:

The first line will contain two integers n, q (1 ≤ n ≤ 10⁵, 0 ≤ q ≤ 50 000), the length of the string and the number of queries respectively.

Next line contains a string S itself. It contains only lowercase English letters.

Next q lines will contain three integers each i, j, k (1 ≤ i ≤ j ≤ n, $\text{[math]}$ ).

输出描述:

Output one line, the string S after applying the queries.

示例1

输入

复制

10 5
abacdabcda
7 10 0
5 8 1
1 4 0
3 6 0
7 10 1

输出

复制

cbcaaaabdd

示例2

输入

复制

10 1
agjucbvdfk
1 10 1

输出

复制

abcdfgjkuv

备注:

First sample test explanation:

$\text{[math]}$