#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

const int prime_max = 10000001;
short divp[prime_max];

void cprime() {
	for(int i=2;i<prime_max;i++) if(divp[i]==0) {
		for(ll j=1LL*i*i;j>i&&j<prime_max;j+=i) divp[j]=i;
	}
}

int T;
int N,X,A,B,M;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cprime();
	cin>>T;
	while(T--) {
		cin>>N>>X>>A>>B>>M;
		
		ll ret=0;
		
		multiset<int> MM;
		
		for(i=0;i<N;i++) {
			x = 1;
			FORR(r,MM) {
				x=x*r%9;
				if(x==0) break;
			}
			if(x==0) x=9;
			ret += x*(X%10);
			
			if(i<N-1) {
				x = N-1-i;
				y = 1+i;
				while(divp[x]) MM.insert(divp[x]), x /= divp[x];
				if(x>1) MM.insert(x);
				while(divp[y]) MM.erase(MM.find(divp[y])), y /= divp[y];
				if(y>1) MM.erase(MM.find(y));
			}
			
			X = ((X^A)+B)%M;
		}
		while(ret>=10) ret=ret%10+ret/10;
		
		cout<<ret<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}