#include #define gcd(a,b) __gcd(a,b) #define mod 998244353 #define INF 0x3f3f3f3f #define eps 1e-6 #define pb push_back #define rep(i,x,y) for(int i=x;i>=1; res=res*res%c; } return ans; } void solve(){ ll a,b,k; ll x,y; cin>>a>>b>>k; if(k==0){ x=a; y=b; } else if(k%2==0){ ll tmp=k/2; x=(quickpow(2,tmp,mod)%mod*(a%mod))%mod; y=(quickpow(2,tmp,mod)%mod*(b%mod))%mod; }else{ ll tmp=(k-1)/2; ll xx,yy; xx=(quickpow(2,tmp,mod)%mod*(a%mod))%mod; yy=(quickpow(2,tmp,mod)%mod*(b%mod))%mod; x=(xx%mod+yy%mod)%mod; y=(xx%mod-yy%mod+mod+mod)%mod; } cout<>T; while(T--){ solve(); } }