#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
vector<char> inv={0,1,5,0,7,2,0,4,8};
int maxN=1e7+10;
vector<char> a(maxN);
vector<int> b(maxN);
void precalc(){
  a[0]=1;b[0]=0;
  for(int i=1;i<maxN;i++){
    if(i%3==0){
      a[i]=a[i/3];
      b[i]=b[i/3]+1;
    }
    else a[i]=i%9;
  }
  for(int i=1;i<maxN;i++){
    a[i]=(a[i-1]*a[i])%9;
    b[i]+=b[i-1];
  }
}
ll comb(ll n,ll k){
  ll bs=b[n]-b[k]-b[n-k];
  if(bs>=2)return 0;
  if(bs)bs=3;
  else bs=1;
  bs=bs*a[n]*inv[a[n-k]]*inv[a[k]]%9;
  return bs;
}
int main(){
  precalc();
  ll t;cin >> t;
  /*for(int i=maxN-20;i<maxN;i++){
    cout << b[i] << endl;
  }*/
  int n,x,a,b,m;
  while(t--){
    cin >> n >> x >> a >> b >> m;
    int ans=0;
    bool zero=true;
    rep(i,n){
      if(x%10)zero=false;
      ans+=(x%10)*comb(n-1,i)%9;
      x=((x^a)+b)%m;
    }
    ans%=9;
    if((!zero)&&(!ans))ans+=9;
    cout << ans << endl;
  }
}