This task is very simple. Given a string S of length n and q queries each query is on the format i j k 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.

Input

The first line will contain two integers n, q (1 ≤ n ≤ 105, 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, $$k \in \{0, 1\}$$).

Output

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

见题面 Input 部分

见题面 Output 部分

First sample test explanation:

$$abacda \rightarrow abacdacba$$

$$aba cd adc ba \rightarrow aba cac dd d ba$$

$$abacacddba \rightarrow cbaaacaddbac$$

$$cbaaacddba \rightarrow cbcaaaadba$$

$$cbcaaaadba \rightarrow cbcaaaabdd$$