B"Sasha gave Anna a list a of n integers for Valentine's Day. Anna doesn't need this list, so she suggests destroying it by playing a game. Players take turns. Sasha is a gentleman, so he gives Anna the right to make the first move. Players can't skip turns. The game ends when Sasha can't make a move, i.e. after Anna's move there is exactly one number left in the list. If this integer is not less than 10^m (i.e., ge 10^m ), Sasha wins. Otherwise, Anna wins. It can be shown that the game will always end. Determine who will win if both players play optimally. The first line contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Then follows the description of the test cases. The first line of each test case contains integers n , m ( 1 <= n <= 2 cdot 10^5 , 0 <= m <= 2 cdot 10^6 ) -- the number of integers in the list and the parameter determining when Sasha wins. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ) -- the list that Sasha gave to Anna. It is guaranteed that the sum of n for all test cases does not exceed 2 cdot 10^5 . For each test case, output: Consider the first test case. Anna can reverse the integer 2 , then Sasha can concatenate the integers 2 and 14 , obtaining the integer 214 , which is greater than 10^2 = 100 . If Anna had reversed the integer 14 , Sasha would have concatenated the integers 41 and 2 , obtaining the integer 412 , which is greater than 10^2 = 100 . Anna has no other possible moves, so she loses. "...