B. Rebranding

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The name of one small but proud corporation consists of n lowercase English letters. The Corporation has decided to try rebranding — an active marketing strategy, that includes a set of measures to change either the brand (both for the company and the goods it produces) or its components: the name, the logo, the slogan. They decided to start with the name.

For this purpose the corporation has consecutively hired m designers. Once a company hires the i-th designer, he immediately contributes to the creation of a new corporation 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 corporation.

Manager Arkady has recently got a job in this company, but is already soaked in the spirit of teamwork and is very worried about the success of the rebranding. Naturally, he can't wait to find out what is the new name the Corporation will receive.

Satisfy Arkady's curiosity and tell him the final version of the name.

Input

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 corporation.

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

Print the new name of the corporation.

Sample test(s)

input

6 1policep m

output

molice

input

11 6abacabadabaa bb ca de gf ab b

output

cdcbcdcfcdc

Note

In the second sample the name of the corporation consecutively changes as follows:

解题说明：此题是一道模拟题，对字符不断进行替换，可以统计出字符串中每个字母的情况，根据对应关系替换，最后输出即可。

#include<stdio.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;int main(){int n, m, map[26], i;char str[200000], x[2], y[2];scanf("%d %d", &n, &m);scanf("%s", str);for(i=0; i<26; i++){map[i] = i;}while(m--){scanf("%s %s", x, y);for(i=0; i<26; i++){if(map[i] == x[0]-'a'){map[i] = y[0]-'a';}else if(map[i] == y[0]-'a'){map[i] = x[0]-'a';}}}for(i=0; i<n; i++){printf("%c", map[str[i]-'a']+'a');}printf("\n");return 0;}