#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int inverse(int x, int mod){
    long long a = x, b = mod, u = 1, v = 0;
    while(b) {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    if(u < 0)u += mod;
    return (int)u;
}

int n, x, a, b, m;

void sol() {
    int z = 1, r = x, t = 0, c = 1, ans = 0;
    rep(i, n) {
        int S = r % 10;
        z &= S == 0;
        (ans += S*c*(t>=2?0:t==1?3:1)) %= 9;
        r = ((r^a) + b) % m;
        int u = n - i - 1, v = i + 1;
        while(u&&u % 3 == 0)t++, u /= 3;
        while(v&&v % 3 == 0)t--, v /= 3;
        c = (u % 9)*inverse(v % 9, 9) % 9;
    }
    if(!z&&ans == 0)ans = 9;
    printf("%d\n", ans);
}

int main(){
    int T; cin >> T;
    while(T--) {
        scanf("%d%d%d%d%d", &n, &x, &a, &b, &m);
        sol();
    }
}