PROGRAMMING:Words Interesting
One day, Little Gyro found an interesting topic in his Qzone. The English word "beauty" can be made up by the word "eat" and the word "buy"!
Some of his friends reviewed that Brother Yu's mastery of English knowledge is beyond my understanding of conventional English! Little Gyro also thought those words were really fantastic. So he defined these kind of words as "Interesting Words".
To compose an Interesting Word, you can take apart an Interesting Word and form several Source Words. Just like the Interesting Word "beauty" can be taken apart and form the Source Words "eat" and "buy". After that, Little Gyro made the following regulations:
* All the letters from the Interesting Word should be found in all the Source Words, and should obey the given order of the Interesting Word. For example, the Interesting Word "beauty" can't be taken apart or form the Source Words "ate" and "buy".
* All kinds of the letters from the Interesting Word should be found exactly in all the Source Words. For example, the Interesting Word "beauty" can't be taken apart or form the Source Words "heat" and "buy", but the Source Words "beat" and "buy" is OK.
* The number of all the letters from the Source Words should be no less than that in the Interesting Word. For example, the Interesting Word “beauty” can't be taken apart or form the Source Words "at" and "buy".
Now given the Interesting Word and the Source Words, Little Gyro wants to know whether the Interesting Word can be made up by these given Source Words. Please help him.
### Input Specification:
There are multiple test cases. The first line of the input contains an integer $$N$$, indicating the number of test cases. For each test case:
The first line contains a string $$S$$ and an integer $$n$$ (1 ≤ $$|S|$$ ≤ $$10^5$$, 1 ≤ $$n$$ ≤ 20), indicating the Interesting Word and the number of the Source Words, $$|S|$$ indicating the length of the string.
In the following $$n$$ lines, each line contains a string $$T$$ (1 ≤ $$|T|$$ ≤ $$10^5$$), indicating the following Source Words, $$|T|$$ indicating the length of each string.
It's guaranteed that the string can only be made up by the lowercase letters, and the sum of the length of the string $$|S|$$ and $$|T|$$ of all test cases will not exceed 2 ×$$ 10^6$$.
### Output Specification:
For each test case, if the Interesting Word can be made up by these given Source Words, print "Yes" (without quotes), otherwise, print "No" (without quotes) instead.
### Sample Input:
```in
five
beauty 2
eat
buy
beauty 2
ate
buy
beauty 2
heat
buy
beauty 2
beat
buy
beauty 2
at
buy
```
### Sample Output:
```out
Yes
No
No
Yes
No
```
answer：If there is no answer, please comment
Some of his friends reviewed that Brother Yu's mastery of English knowledge is beyond my understanding of conventional English! Little Gyro also thought those words were really fantastic. So he defined these kind of words as "Interesting Words".
To compose an Interesting Word, you can take apart an Interesting Word and form several Source Words. Just like the Interesting Word "beauty" can be taken apart and form the Source Words "eat" and "buy". After that, Little Gyro made the following regulations:
* All the letters from the Interesting Word should be found in all the Source Words, and should obey the given order of the Interesting Word. For example, the Interesting Word "beauty" can't be taken apart or form the Source Words "ate" and "buy".
* All kinds of the letters from the Interesting Word should be found exactly in all the Source Words. For example, the Interesting Word "beauty" can't be taken apart or form the Source Words "heat" and "buy", but the Source Words "beat" and "buy" is OK.
* The number of all the letters from the Source Words should be no less than that in the Interesting Word. For example, the Interesting Word “beauty” can't be taken apart or form the Source Words "at" and "buy".
Now given the Interesting Word and the Source Words, Little Gyro wants to know whether the Interesting Word can be made up by these given Source Words. Please help him.
### Input Specification:
There are multiple test cases. The first line of the input contains an integer $$N$$, indicating the number of test cases. For each test case:
The first line contains a string $$S$$ and an integer $$n$$ (1 ≤ $$|S|$$ ≤ $$10^5$$, 1 ≤ $$n$$ ≤ 20), indicating the Interesting Word and the number of the Source Words, $$|S|$$ indicating the length of the string.
In the following $$n$$ lines, each line contains a string $$T$$ (1 ≤ $$|T|$$ ≤ $$10^5$$), indicating the following Source Words, $$|T|$$ indicating the length of each string.
It's guaranteed that the string can only be made up by the lowercase letters, and the sum of the length of the string $$|S|$$ and $$|T|$$ of all test cases will not exceed 2 ×$$ 10^6$$.
### Output Specification:
For each test case, if the Interesting Word can be made up by these given Source Words, print "Yes" (without quotes), otherwise, print "No" (without quotes) instead.
### Sample Input:
```in
five
beauty 2
eat
buy
beauty 2
ate
buy
beauty 2
heat
buy
beauty 2
beat
buy
beauty 2
at
buy
```
### Sample Output:
```out
Yes
No
No
Yes
No
```
answer：If there is no answer, please comment