Problem Description
Satre has finally decided to put their famous Letter Cookies back on market again. Of course they are just as interesting to play with as to eat. Your little sister is trying to make words out of the letters she found in the box, but you want to be faster than her to decide whether it is possible to make the word or not.
Given the letters in the cookie box, is it possible to spell out the words your little sister knows how to spell? (After creating a word, she scrambles the cookies again and can reuse the letters for later words.)
Input
The first line of the input consists of a single number T, the number of letter cookie boxes your sister has. Each test case starts with a line describing all the letters in this box, in no particular order. Then follows a line with W, the number of words she would like to spell, and then follow the W words to write on a single line each.
Output
For each word, output a line containing YES if it is possible to spell the word, or NO if it is not possible.
Notes and Constraints
0 < T <= 100
0 < W <= 100
All letters are uppercase letters from the english alphabet (A-Z).
There are at most 1000 letters in each cookie box.
Each word has at most 100 letters (but is not necessarily an actual English word).
Sample Input
1
ABANANACOOKIE
4
BANANA
LETTER
COOKIES
CAN
Sample Output
YES
NO
NO
YES
