Wordle

 Chef invented a modified wordle.

There is a hidden word S$S$ and a guess word T$T$, both of length 5$5$.

Chef defines a string M$M$ to determine the correctness of the guess word. For the ith$i^{th}$ index:

• If the guess at the ith$i^{th}$ index is correct, the ith$i^{th}$ character of M$M$ is G$\mathtt{\text{G}}$.
• If the guess at the Ith$I^{th}$ index is wrong, the ith$i^{th}$ character of M$M$ is B$\mathtt{\text{B}}$.

Given the hidden word S$S$ and guess T$T$, determine string M$M$.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.
• Each test case contains of two lines of input.
• First line contains the string S$S$ - the hidden word.
• Second line contains the string T$T$ - the guess word.

Output Format

For each test case, print the value of string M$M$.

You may print each character of the string in uppercase or lowercase (for example, the strings BgBgB$\mathtt{\text{BgBgB}}$, BGBGB$\mathtt{\text{BGBGB}}$, bgbGB$\mathtt{\text{bgbGB}}$ and bgbgb$\mathtt{\text{bgbgb}}$ will all be treated as identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$
• |S|=|T|=5$|S|=|T|=5$
• S,T$S,T$ contain uppercase english alphabets only.

Sample Input 1 

3
ABCDE
EDCBA
ROUND
RINGS
START
STUNT

Sample Output 1 

BBGBB
GBBBB
GGBBG

Explanation

Test Case 1$1$: Given string S=ABCDE$S=\mathtt{\text{ABCDE}}$ and T=EDCBA$T=\mathtt{\text{EDCBA}}$. The string M$M$ is:

• Comparing the first indices, A≠E$\mathtt{\text{A}}\ne \mathtt{\text{E}}$, thus, M[1]=B$M[1]=\mathtt{\text{B}}$.
• Comparing the second indices, B≠D$\mathtt{\text{B}}\ne \mathtt{\text{D}}$, thus, M[2]=B$M[2]=\mathtt{\text{B}}$.
• Comparing the third indices, C=C$\mathtt{\text{C}}=\mathtt{\text{C}}$, thus, M[3]=G$M[3]=\mathtt{\text{G}}$.
• Comparing the fourth indices, D≠B$\mathtt{\text{D}}\ne \mathtt{\text{B}}$, thus, M[4]=B$M[4]=\mathtt{\text{B}}$.
• Comparing the fifth indices, E≠A$\mathtt{\text{E}}\ne \mathtt{\text{A}}$, thus, M[5]=B$M[5]=\mathtt{\text{B}}$.
  Thus, M=BBGBB$M=\mathtt{\text{BBGBB}}$.

Test Case 2$2$: Given string S=ROUND$S=\mathtt{\text{ROUND}}$ and T=RINGS$T=\mathtt{\text{RINGS}}$. The string M$M$ is:

• Comparing the first indices, R=R$\mathtt{\text{R}}=\mathtt{\text{R}}$, thus, M[1]=G$M[1]=\mathtt{\text{G}}$.
• Comparing the second indices, O≠I$\mathtt{\text{O}}\ne \mathtt{\text{I}}$, thus, M[2]=B$M[2]=\mathtt{\text{B}}$.
• Comparing the third indices, U≠N$\mathtt{\text{U}}\ne \mathtt{\text{N}}$, thus, M[3]=B$M[3]=\mathtt{\text{B}}$.
• Comparing the fourth indices, N≠G$\mathtt{\text{N}}\ne \mathtt{\text{G}}$, thus, M[4]=B$M[4]=\mathtt{\text{B}}$.
• Comparing the fifth indices, D≠S$\mathtt{\text{D}}\ne \mathtt{\text{S}}$, thus, M[5]=B$M[5]=\mathtt{\text{B}}$.
  Thus, M=GBBBB$M=\mathtt{\text{GBBBB}}$.