codeforces #327 (Div. 2) ->B. 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 x_iby y_i, and all the letters y_i by x_i. 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 x_i coincides with y_i. 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 x_iand y_i.

Output

Print the new name of the corporation.

Examples

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:

题意：就是给你一个字符串，给你n行，每行两个字母，表示字符串里这两个字母交换，问你经过n次变换之后的结果是多少。

数据是2*100000，直接暴力的话肯定超时，我的想法是 给你的两个字母 a b 我就默认 a是b，b是a。

也就是说把原来按顺序排列的26个字母表1整成替换了之后的字母表2，然后把原来的字符串对着字母表2扫一遍就好了

#include<bits/stdc++.h>
using  namespace std;
char  s[200005],ch1,ch2;
int a[30];

int main(){
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    int n,m,num1,num2;
    scanf("%d %d",&n,&m);
    scanf("%s",s+1);
    for(int i=1 ; i<=26 ; i++){
        a[i]=i;
    }
    for(int i=1 ; i<=m ; i++){
        scanf(" %c %c",&ch1,&ch2);
        num1=ch1-'a'+1;
        num2=ch2-'a'+1;
        for(int j=1;j<=26;j++){//不能简单的swap(a[num1],a[num2]);
            if(a[j]==num1){
                a[j]=num2;
            }
            else if(a[j]==num2){
                a[j]=num1;
            }
        }
    }
    for(int i=1 ; i<=n ; i++){
        num1=s[i]-'a'+1;
        printf("%c",a[num1]+'a'-1);
    }
    printf("\n");
    return  0;
}