codeforces round#237,div2,B,Rebranding（模拟）

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 xiby 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 lettersxi 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:

题意：给你一个串。然后给出N个字母对a,b。原来串中的a变成b,b变成a...解法：其实仔细想想有点像交换群耶，，比如

1 2 3 (a,b),(b,c) 1 2 3 1 2 3

a b c -------------> b a c--> c a b

最后原来1的地方变成c,2的地方变成a,3的地方变成了b。。

123换成26个字母。对应去找各个字母之后对应什么字母就行了。。。然后遍历一次串，分别替换掉字母就可以了。。。就是将原来的字母对应变化后得什么字母全找出来。。

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#pragma comment(linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define EPS 1e-6    //log(x)
#define e exp(1.0); //2.718281828
#define mod 1000000007
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
typedef long long LL;
using namespace std;
int father[100];
int main()
{
    int n,m;
    char a[200005];
    char x,y;
    int flag1,flag2;
    for(int i=0;i<100;i++) father[i]=i;
    scanf("%d %d",&n,&m);
    getchar();
    for(int i=0;i<n;i++) scanf("%c",&a[i]);
   // puts(a);
    for(int i=0;i<m;i++)
    {
        getchar();
        scanf("%c %c",&x,&y);
        int pp=x-'a'+1;
        int qq=y-'a'+1;
        for(int i=1;i<30;i++)
        {
            if(father[i]==pp) flag1=i;
            if(father[i]==qq) flag2=i;
        }
        father[flag1]=qq;
        father[flag2]=pp;

        //for(int i=1;i<30;i++) printf("%d",father[i]);
        //puts("");
    }
    for(int i=0;i<n;i++)
    {
        printf("%c",father[a[i]-'a'+1]+'a'-1);
    }

    return 0;
}

/*
                   _ooOoo_
                  o8888888o
                  88" . "88
                  (| -_- |)
                  O\  =  /O
               ____/`---'\____
             .'  \\|     |//  `.
            /  \\|||  :  |||//  \
           /  _||||| -:- |||||-  \
           |   | \\\  -  /// |   |
           | \_|  ''\---/''  |   |
           \  .-\__  `-`  ___/-. /
         ___`. .'  /--.--\  `. . __
      ."" '<  `.___\_<|>_/___.'  >'"".
     | | :  `- \`.;`\ _ /`;.`/ - ` : | |
     \  \ `-.   \_ __\ /__ _/   .-` /  /
======`-.____`-.___\_____/___.-`____.-'======
                   `=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
       I also have a dream!A AC deram!
*/