There are N number of government projects running across the country. The project details are maintained by the secretary. He keeps the initials (the first letter of the name of the project)of each project in the form of string S . As the new government comes into power, they tend to replace the name of the projects. The secretary thus performs two kinds of queries on the string S.

type 1 query : If a certain project is changed, replacing its initial character in string with new one.

type 2 query : Printout the project at given position X if the characters in the string were arranged alphabetically.

Note: the string contains only Upper-case Alphabets.

INPUT:

The first line of the input contains two space-separated integers, N (the number of characters in the string) and Q (total number of queries), respectively.

The second line of the input contains the string S.

Each of the next Q lines contains a query . The query is one of the following two types:

• 1 X C -the query is of type 1, the character at the position X (integer) in the string should be replaced by C (character) .
• 2 X -the query is of type 2, print out the character which would be present at the position X (integer) in the string if the characters in the string were arranged alphabetically.

OUTPUT:

For every query of type 2 print the character present at the position X if the characters in the string were arranged in the alphabetical order.

CONSTRAINTS:

1≤N≤10⁵

1≤Q≤10⁵

Each query is of type 1 or type 2.

1≤X≤N

C can be any alphabet between A to Z.