A Serial Killer

A. A Serial Killer

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.

The killer starts with two potential victims on his first day, selects one of these two, kills selected victim and replaces him with a new person. He repeats this procedure each day. This way, each day he has two potential victims to choose from. Sherlock knows the initial two potential victims. Also, he knows the murder that happened on a particular day and the new person who replaced this victim.

You need to help him get all the pairs of potential victims at each day so that Sherlock can observe some pattern.

Input

First line of input contains two names (length of each of them doesn't exceed 10), the two initials potential victims. Next line contains integer n (1 ≤ n ≤ 1000), the number of days.

Next n lines contains two names (length of each of them doesn't exceed 10), first being the person murdered on this day and the second being the one who replaced that person.

The input format is consistent, that is, a person murdered is guaranteed to be from the two potential victims at that time. Also, all the names are guaranteed to be distinct and consists of lowercase English letters.

Output

Output n + 1 lines, the i-th line should contain the two persons from which the killer selects for the i-th murder. The (n + 1)-th line should contain the two persons from which the next victim is selected. In each line, the two names can be printed in any order.

Examples

input

ross rachel4ross joeyrachel phoebephoebe monicamonica chandler

output

ross racheljoey racheljoey phoebejoey monicajoey chandler

input

icm codeforces1codeforces technex

output

icm codeforcesicm technex

Note

In first example, the killer starts with ross and rachel.

• After day 1, ross is killed and joey appears.
• After day 2, rachel is killed and phoebe appears.
• After day 3, phoebe is killed and monica appears.

• After day 4, monica is killed and chandler appears.

昨晚网卡到要命，也没做，这是道水题，题意大致为：连环杀人犯每天都会挑选两个受害者，并从中挑选一个进行谋杀，被谋杀的会重新被其他人代替

，侦探知道杀人犯最开始的时候想杀的两个人，并且也知道杀人犯每天挑选的目标和要杀的那个人，问你没经过一天后幸存下来的人的名单。直接上代码

#include<stdio.h>#include<string.h>#include<stdlib.h>char s1[20],s2[20],s3[20],s4[20];int n;int main(){int i;scanf("%s %s",s1,s2); //输入原始受害人名单printf("%s %s\n",s1,s2);scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %s",s3,s4); //s3是第一天受害人的名单if(!strcmp(s3,s1))  //如果s1是受害人，那么s2活下来了 {strcpy(s1,s4);printf("%s %s\n",s1,s2); }else  //受害人是s2，那么s1活下来了 {strcpy(s2,s4);printf("%s %s\n",s1,s2);}  }return 0; }