#include using namespace std; #define F first #define S second #define R cin>> #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; ll mod_pow(ll x,ll n,ll mod){ if(!n)return 1; ll res=mod_pow(x*x%mod,n/2,mod); if(n&1)res=res*x%mod; return res; } void extended_euclid(ll x,ll y,ll *c,ll *a,ll *b){ ll a0,a1,a2,b0,b1,b2,r0,r1,r2,q;r0=x;r1=y;a0=1;a1=0;b0=0;b1=1; while(r1>0){q=r0/r1;r2=r0%r1;a2=a0-q*a1;b2=b0-q*b1;r0=r1;r1=r2;a0=a1;a1=a2;b0=b1;b1=b2;} *c=r0;*a=a0;*b=b0; } ll get_inv(ll n, ll p){ ll a,b,c; extended_euclid(n,p,&c,&a,&b); if(a> T; while(T--) { ll n,m,x; cin >> n >> m >> x; ll sum=mod_pow(m+1,n,MAX),k=0; if((m+1)%2) { k++; sum+=MAX-1; sum%=MAX; } sum*=get_inv(2,MAX); sum%=MAX; ll d1=sum+k,d2=sum; ll s=mod_pow(m-1,n,MAX); if((m-1)%2) { s+=MAX-1; s%=MAX; } s=s*get_inv(2,MAX)%MAX; d1+=s;d2-=s; d1%=MAX; d2+=MAX; d2%=MAX; if(n%2!=x) swap(d1,d2); pr(d1,d2); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}