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.
The first line will contain two integers *n*, *q* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 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*, <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/187c38b0d200dfc5b5249f93c000f8dee9c1180d.png" style="max-width: 100.0%;max-height: 100.0%;"/>).
def get_input():
    input_nums = input()#n, q
    n, q = input_nums.split(' ')
    n, q = int(n), int(q)
    input_string = list(input())
    queries = []
    for i in range(q):
        a = tuple(int(x) for x in input().split(' '))
        queries.append(a)
    return queries, input_string

def get_sorted(queries, string):
    for i, j, k in queries:
        if k == 0:
            string[i-1: j] = sorted(string[i-1: j], reverse=True)
        else:
            string[i-1: j] = sorted(string[i-1: j])
    return print(''.join(string))

queries, string = get_input()
get_sorted(queries, string)