# Deletions of Two Adjacent Letters solution codeforces

The string ss is given, the string length is odd number. The string consists of lowercase letters of the Latin alphabet.

As long as the string length is greater than 11, the following operation can be performed on it: select any two adjacent letters in the string ss and delete them from the string. For example, from the string “lemma” in one operation, you can get any of the four strings: “mma“, “lma“, “lea” or “lem” In particular, in one operation, the length of the string reduces by 22.

Formally, let the string ss have the form s=s1s2sns=s1s2…sn (n>1n>1). During one operation, you choose an arbitrary index ii (1i<n1≤i<n) and replace s=s1s2si1si+2sns=s1s2…si−1si+2…sn.

For the given string ss and the letter cc, determine whether it is possible to make such a sequence of operations that in the end the equality s=cs=c will be true? In other words, is there such a sequence of operations that the process will end with a string of length 11, which consists of the letter cc?

## Input Deletions of Two Adjacent Letters solution codeforces

The first line of input data contains an integer tt (1t1031≤t≤103) — the number of input test cases.

The descriptions of the tt cases follow. Each test case is represented by two lines:

• string ss, which has an odd length from 11 to 4949 inclusive and consists of lowercase letters of the Latin alphabet;
• is a string containing one letter cc, where cc is a lowercase letter of the Latin alphabet.

### Output Deletions of Two Adjacent Letters solution codeforces

For each test case in a separate line output:

• YES, if the string ss can be converted so that s=cs=c is true;
• NO otherwise.

You can output YES and NO in any case (for example, the strings yEsyesYes and YES will be recognized as a positive response).

Example
input

### Copy Deletions of Two Adjacent Letters solution codeforces

5
abcde
c
abcde
b
x
y
aaaaaaaaaaaaaaa
a
contest
t

output

## Copy Deletions of Two Adjacent Letters solution codeforces

YES
NO
NO
YES
YES


## Note Deletions of Two Adjacent Letters solution codeforces

In the first test case, ss=”abcde“. You need to get ss=”c“. For the first operation, delete the first two letters, we get ss=”cde“. In the second operation, we delete the last two letters, so we get the expected value of ss=”c“.

In the second test case, ss=”x“, it is required to get ss=”y“. Obviously, this cannot be done.