Harry is fond of a lucky number. Whenever he is given an array of numbers, he starts checking if (all) digits of his lucky number are present in the array. Help him in finding these!
Input Format: First line contains the number of test-cases (T) For each of the test cases, there are two lines. First line contains two space separated integers n (size of the array) and L (Lucky number). Second line contains n space separated integers of the array.
Output Format: Print “YES” (without quotes) if ALL the digits of L are contained in the array,”NO” otherwise. Output for each test case should be in a a separate line.
In case 1, both 4 and 5 are present in the array. In the second case, 2 is present only once in the array, so ALL the digits aren't present.
