cf 591B Rebranding

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 byyi, 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 1
police
p m

output

molice

input

11 6
abacabadaba
a b
b c
a d
e g
f a
b b

output

cdcbcdcfcdc

Note

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

题意：给你一个只由小写字母组成的串，然后给你m改变，每次给你两个字母c1,c2要你在输出c1的地方输出c2，输出最终的串

思路：由于时间不够一遍一遍暴力模拟，就考虑O(n)的算法，考虑等效替代的方法

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int main()
{
    int x[200],m,n;
    char a,b,s[200010];
    for(int i = 0; i < 200; i++)
        x[i] = i;
    cin>>n>>m;
    getchar();
    scanf("%s",s);
    getchar();
    while(m--){
        scanf("%c %c",&a,&b);
        getchar();
        int x1,x2;
        for(int i = 'a'; i <= 'z'; i++){
            if(x[i] == a) x1 = i;
            if(x[i] == b) x2 = i;
        }
            x[x1] = b;
            x[x2] = a;
    }
    for(int i = 0; i < n; i++)
        printf("%c",x[s[i]]);
    cout<<endl;
    return 0;
}