#include<bits/stdc++.h>
#define uint unsigned int
#define ll long long
#define N 100005
#define K 20
#define pii pair<int,int>
#define x first
#define y second
#define pct __builtin_popcount
//#define mod 1000000007
#define pi acos(-1)
#define inf 2e18
#define eps 1e-8
using namespace std;
int T=1,n,m,mod=1<<30,lg[N];
uint f[N][K];
uint X,Y,Z,W;
uint rng61(){
	X=X^(X<<11);
	X=X^(X>>4);
	X=X^(X<<5);
	X=X^(X>>14);
	W=X^(Y^Z);
	X=Y;
	Y=Z;
	Z=W;
	return Z; 
}
void init(){
	for(int i=2;i<N;i++){
		lg[i]=lg[i>>1]+1;
	}
}
void modify(uint l,uint r,uint v){
	int k=lg[r-l+1];
	f[l][k]=max(f[l][k],v);
	f[r-(1<<k)+1][k]=max(f[r-(1<<k)+1][k],v);
}
void work(){
	ll res=0;
	for(int j=K-1;j;j--){
		for(int i=1;i+(1<<j-1)<=n;i++){
			f[i][j-1]=max(f[i][j-1],f[i][j]);
			f[i+(1<<j-1)][j-1]=max(f[i+(1<<j-1)][j-1],f[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		res^=(1ll*i*f[i][0]);
	}
	cout<<res<<'\n';
}
void solve(int cs){
	cin>>n>>m>>X>>Y>>Z;
	memset(f,0,sizeof f);
	for(int i=1;i<=m;i++){
		uint a,b,c;
		a=rng61();
		b=rng61();
		c=rng61();
		uint l,r,v;
		l=min(a%n+1,b%n+1);
		r=max(a%n+1,b%n+1);
		v=c%mod;
		modify(l,r,v);
	}
	work();
}
void solution(){
    /*
    nothing here
    */
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
	init();
	cin>>T;
    for(int cs=1;cs<=T;cs++){
        solve(cs);
    }
    return 0;
}