t = int(input())
while t:
a,b,n = map(int,input().split())
if n == 0:
print(a)
elif n == 1:
print(b)
else:
x3 = a ^ b
if (n % 3 == 0):
print(a)
elif n%3==1:
print(b)
else:
print(x3)
t -= 1
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int trials;
cin>>trials;
while(trials--){
int a[3], n, res;
cin>>a[0]>>a[1]>>n;
a[2] = a[0]^a[1];
cout<<a[n%3]<<'\n';
}
return 0;
}1670D - Very Suspicious | 1141B - Maximal Continuous Rest |
1341A - Nastya and Rice | 1133A - Middle of the Contest |
385A - Bear and Raspberry | 1311B - WeirdSort |
1713F - Lost Array | 236B - Easy Number Challenge |
275A - Lights Out | 147A - Punctuation |
253A - Boys and Girls | 1327E - Count The Blocks |
984A - Game | 12B - Correct Solution |
1355B - Young Explorers | 485A - Factory |
628A - Tennis Tournament | 1436B - Prime Square |
1707B - Difference Array | 1422C - Bargain |
1611F - ATM and Students | 660A - Co-prime Array |
1692F - 3SUM | 1470A - Strange Birthday Party |
190D - Non-Secret Cypher | 1721B - Deadly Laser |
1721C - Min-Max Array Transformation | 1721A - Image |
1180C - Valeriy and Deque | 557A - Ilya and Diplomas |