Geek and Function |V
Easy Accuracy: 85.16% Submissions: 3190 Points: 2

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 <= 105
3. 1 <= K <= 109


Example:
Input:

2
17 1
66 3

Output:
22
74

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Geek and Function |V

Output Window