#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL MOD = -1;
LL mod(LL x, LL m = MOD) { return (x % m + m) % m; }
pair<LL, LL> ex_gcd(LL a, LL b) {
	if(b == 0) { return MP(1, 0); }
	auto p = ex_gcd(b, a % b);
	return MP(p.SE, p.FI - (a / b) * p.SE);
}
LL inv(LL x, LL m = MOD) {
	assert(gcd(x, m) == 1);
	auto p = ex_gcd(x, m);
	return mod(p.FI, m);
}

// ----

LL val(LL e, LL v) {
	inc(i, min(2LL, e)) { v *= 3; }
	return v;
}

void mul(LL & e, LL & v, LL x) {
	if(x == 0) { return; }
	while(x % 3 == 0) { e++; x /= 3; }
	(v *= x) %= 9;
}

void div(LL & e, LL & v, LL x) {
	while(x % 3 == 0) { e--; x /= 3; }
	(v *= inv(x, 9)) %= 9;
}

int s[10000000];
int main() {
	int t;
	cin >> t;
	inc(q, t) {
		LL n, x, a, b, m;
		cin >> n >> x >> a >> b >> m;
		
		inc(i, n) { s[i] = (i == 0 ? x : ((s[i - 1] ^ a) + b) % m); }
		inc(i, n) { s[i] %= 10; }
		
		bool f = true;
		inc(i, n) { f &= (s[i] == 0); }
		if(f) { cout << 0 << "\n"; continue; }
		
		LL ans = 0, e = 0, v = 1;
		inc(i, n) {
			(ans += s[i] * val(e, v)) %= 9;
			mul(e, v, n - 1 - i);
			div(e, v, i + 1);
		}
		if(ans == 0) { ans = 9; }
		cout << ans << "\n";
	}
	
	return 0;
}