Given two integers numbers N and K, the Geek wants you to find f(f(..........f(N))) K times, where f(x) = x XOR (x%10).

Note: XOR represents bitwise xor operation

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two integers N and K.

Output: For each test case, print the answer

Constraints:
1. 1 <= T <= 10
2. 1 <= N <= 10⁵
3. 1 <= K <= 10⁹

Example:
Input:
2
17 1
66 3

Output:
22
74