#include <cstdio>
#pragma warning(disable : 4996)
const int inv[] = { 0, 1, 5, 0, 7, 2, 0, 4, 8 };
int q, n, x, a, b, m; short fact[10000009];
int main() {
	fact[0] = 1;
	for (int i = 1; i <= 10000000; ++i) {
		x = i;
		while (x % 3 == 0) x /= 3;
		fact[i] = fact[i - 1] * x % 9;
	}
	scanf("%d", &q);
	while (q--) {
		scanf("%d%d%d%d%d", &n, &x, &a, &b, &m);
		int cur = x, ord = 0, mul = 1, ret = 0, f = 0;
		for (int i = 0; i < n; i++) {
			if (cur % 10 != 0) f = 1;
			ret = (ret + cur % 10 * (ord == 0 ? mul : (ord == 1 ? mul % 3 * 3 : 0))) % 9;
			cur = ((cur ^ a) + b) % m;
			x = i + 1;
			while (x % 3 == 0) x /= 3, ord--;
			mul = mul * inv[x % 9] % 9;
			x = n - i - 1;
			while (x != 0 && x % 3 == 0) x /= 3, ord++;
			mul = mul * x % 9;
		}
		printf("%d\n", ret + (ret == 0 && f == 1 ? 9 : 0));
	}
	return 0;
}