题号：NC205332
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
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 Source Words should be found in the Interesting Word, 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.
输入描述:
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| ≤, 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| ≤
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×.
输出描述:
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.