#include <bits/stdc++.h>
using namespace std;
long long MOD;
vector<vector<long long>> matmul(vector<vector<long long>> A, vector<vector<long long>> B){
  vector<vector<long long>> C(4, vector<long long>(4, 0));
  for (int i = 0; i < 4; i++){
    for (int j = 0; j < 4; j++){
      for (int k = 0; k < 4; k++){
        C[i][k] += A[i][j] * B[j][k];
        C[i][k] %= MOD;
      }
    }
  }
  return C;
}
vector<vector<long long>> matpow(vector<vector<long long>> A, long long N){
  vector<vector<long long>> ans(4, vector<long long>(4, 0));
  for (int i = 0; i < 4; i++){
    ans[i][i] = 1 % MOD;
  }
  while (N > 0){
    if (N % 2 == 1){
      ans = matmul(ans, A);
    }
    A = matmul(A, A);
    N /= 2;
  }
  return ans;
}
vector<vector<long long>> solve(vector<vector<long long>> A, long long N){
  vector<vector<long long>> A2(4, vector<long long>(4, 0));
  for (int i = 0; i < 2; i++){
    for (int j = 0; j < 2; j++){
      A2[i][j] = A[i][j];
    }
  }
  for (int i = 0; i < 2; i++){
    A2[i + 2][i] = 1 % MOD;
    A2[i + 2][i + 2] = 1 % MOD;
  }
  A2 = matpow(A2, N);
  vector<vector<long long>> A3(2, vector<long long>(2));
  for (int i = 0; i < 2; i++){
    for (int j = 0; j < 2; j++){
      A3[i][j] = A2[i + 2][j];
    }
  }
  for (int i = 0; i < 2; i++){
    A3[i][i] += (MOD - 1) % MOD;
    A3[i][i] %= MOD;
  }
  return A3;
}
bool check_odd(vector<vector<long long>> A){
  long long tr = A[0][0] + A[1][1];
  long long det = A[0][0] * A[1][1] - A[0][1] * A[1][0];
  return 1 - tr + det < 0;
}
bool check_even(vector<vector<long long>> A){
  long long tr = A[0][0] + A[1][1];
  long long det = A[0][0] * A[1][1] - A[0][1] * A[1][0];
  return (1 - tr + det < 0) ^ (1 + tr + det < 0);
}
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    long long N, B;
    cin >> N >> B;
    MOD = B;
    vector<vector<long long>> A(2, vector<long long>(2));
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < 2; k++){
        cin >> A[j][k];
      }
    }
    vector<vector<long long>> S = solve(A, N + 1);
    long long ans = S[0][0] * S[1][1] - S[0][1] * S[1][0];
    ans = (ans % MOD + MOD) % MOD;
    if (ans == 0){
      cout << ans << endl;
    } else {
      bool ok = true;
      ok ^= check_odd(A);
      if (N % 2 == 0){
        ok ^= check_odd(A);
      } else {
        ok ^= check_even(A);
      }
      if (!ok){
        ans = (MOD - ans) % MOD;
      }
      cout << ans << endl;
    }
  }
}