Joseph developed an editing software called Pandote recently, and now he is testing it to make sure it works correctly, otherwise, he will probably get fired!
Joseph starts his testing by implementing copying and pasting as well as reversing operations to the string on the Pandote. More specifically, in each step, if the string on the screen is , he will do the following operations in order.

1. Choose a prefix of length , then can be denoted by . Note that the string can be empty.
2. Swap the two parts and get the string .
3. Reverse the whole string and get the string .

However, since the function of Pandote is limited, there are only two different lengths and of prefix he can choose in each step. Now Joseph wants to know whether he can convert the string to through several (possibly zero) steps.

The first line of the input gives the number of test cases .  test cases follow.
For each test case, the first line contains the string  and the second line contains the string . Both  and  are consisting of lowercase Latin letters and .
the third line contains two integers  and , denoting the length of the prefix he can choose in each step.
It is guaranteed that the sum of  over all test cases does not exceed .

For each test case, print  if he can convert  to . Otherwise, print .

3
ljhelloh
hellohlj
2 4
thisisastr
htrtsasisi
3 5
abcde
bcdea
1 4

yes
no
yes

For the first testcase, one possible method is