import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum modInv = [0, 1, 5, 0, 7, 2, 0, 4, 8];

void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const N = readInt();
        const X = readInt();
        const A = readInt();
        const B = readInt();
        const M = readInt();
        int r = X;
        
        bool zero = true;
        int ans;
        /*
          N-1 N-2 N-3 ...
          1   2   3   ...
        */
        int d = 1, e = 0;
        foreach (i; 0 .. N) {
          const s = r % 10;
          
          if (i > 0) {
            int dd, ee;
            // *= (N - i)
            for (dd = N - i, ee = 0; dd % 3 == 0; dd /= 3, ++ee) {}
            (d *= dd) %= 9;
            e += ee;
            // /= i
            for (dd = i, ee = 0; dd % 3 == 0; dd /= 3, ++ee) {}
            (d *= modInv[dd]) %= 9;
            e -= ee;
          }
          
          zero = zero && (s == 0);
          (ans += ((e == 0) ? d : (e == 1) ? (d * 3) : 0) * s) %= 9;
          
          r = ((r ^ A) + B) % M;
        }
        if (!zero && ans == 0) {
          ans = 9;
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}