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%;"/>).
x=input()
n=int(x.split()[0])
q=int(x.split()[1])
z=input()
for i1 in range(q):
    y=input()
    i=int(y.split()[0])
    j=int(y.split()[1])
    k=int(y.split()[2])
    a=z[(i-1):j]
    a=list(a)
    if k==1:
        a.sort()
    if k==0:
        a.sort()
        a=a[::-1]
    
    p=""
    for l in a:
         p=p+l
    
    z=z[0:i-1]+p+z[j:len(z)]
    
print(z)