The name of a small but proud firm consists of n lowercase English letters. The firm has decided to try rebranding — an active marketing strategy, that includes a set of measures to change either the brand or its components: the name, the logo, the slogan. They decided to start with the name.
For this purpose the firm has consecutively hired m designers. Once a firm hires the i-th designer, he immediately contributes to the creation of a new firm name as follows: he takes the newest version of the name and replaces all the letters xi by yi, and all the letters yi by xi. This results in the new version. It is possible that some of these letters do no occur in the string. It may also happen that xi coincides with yi. The version of the name received after the work of the last designer becomes the new name of the firm.
BOT Helium has recently got a job in this company, and wants to find out what is the new name the Firm will receive.
Satisfy Helium's curiosity and tell him the final version of the name.
INPUT FORMAT
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the length of the initial name and the number of designers hired, respectively.
The second line consists of n lowercase English letters and represents the original name of the firm.
Next m lines contain the descriptions of the designers' actions: the i-th of them contains two space-separated lowercase English letters xi and yi.
OUTPUT FORMAT
Print the new name of the firm.