#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= M);
    return *this;
  }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;

constexpr int LIM_INV = 1'000'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


struct F {
  Mint x, y;
  F(Mint x_ = 0, Mint y_ = 0) : x(x_), y(y_) {}
  friend ostream &operator<<(ostream &os, const F &f) {
    if (!f.y) return os << f.x;
    if (!f.x) return os << f.y << "i";
    return os << f.x << "+" << f.y << "i";
  }
  F operator+(const F &f) const { return F(x + f.x, y + f.y); }
  F operator*(const F &f) const { return F(x * f.x - y * f.y, x * f.y + y * f.x); }
  F operator*(const Mint &a) const { return F(x * a, y * a); }
};

int main() {
  int MO;
  for (int numCases; ~scanf("%d%d", &numCases, &MO); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    Mint::setM(MO);
    prepare();
    const F I[4] = {F(1, 0), F(0, 1), F(-1, 0), F(0, -1)};
    
    int N, A[4];
    scanf("%d", &N);
    for (int j = 0; j < 4; ++j) {
      scanf("%d", &A[j]);
    }
    
    /*
      i^1: at most 1
      i^3: at most 1
      i^0, i^2: not both
    */
    F ans;
    for (const int s : {0, 2}) {
      int base = 0;
      for (int j = 0; j < 4; ++j) {
        base -= A[j] * (s * j);
      }
      base &= 3;
      if (N >= (s ? 1 : 0)) {
        // 2^binom(N,2)
        const F f = I[base] * Mint(2).pow((Int)N*(N-1)/2);
// cerr<<"s="<<s<<" "<<__LINE__<<"> "<<f<<endl;
        ans = ans + f;
      }
      if (N - 1 >= (s ? 1 : 0)) {
        F f;
        for (int j1 = 0; j1 < 4; ++j1) if (A[j1]) {
          f = f + I[(base - 1 * j1) & 3] * A[j1];
        }
        // 2^binom(N-1,2) (1+i)^(N-1)
        f = f * Mint(2).pow((Int)(N-1)*(N-2)/2 + (N-1)/2) * I[((N-1)/2) & 3];
        if ((N-1) & 1) {
          f = f * F(1, 1);
        }
// cerr<<"s="<<s<<" "<<__LINE__<<"> "<<f<<endl;
        ans = ans + f;
      }
      if (N - 1 >= (s ? 1 : 0)) {
        F f;
        for (int j3 = 0; j3 < 4; ++j3) if (A[j3]) {
          f = f + I[(base - 3 * j3) & 3] * A[j3];
        }
        // 2^binom(N-1,2) (1-i)^(N-1)
        f = f * Mint(2).pow((Int)(N-1)*(N-2)/2 + (N-1)/2) * I[(-((N-1)/2)) & 3];
        if ((N-1) & 1) {
          f = f * F(1, -1);
        }
// cerr<<"s="<<s<<" "<<__LINE__<<"> "<<f<<endl;
        ans = ans + f;
      }
      if (N - 2 >= (s ? 1 : 0)) {
        F f;
        for (int j1 = 0; j1 < 4; ++j1) if (A[j1]) {
          const Mint a = A[j1];
          --A[j1];
          for (int j3 = 0; j3 < 4; ++j3) if (A[j3]) {
            const Mint aa = a * A[j3];
            f = f + I[(base - 1 * j1 - 3 * j3) & 3] * aa;
          }
          ++A[j1];
        }
        // 2^binom(N-2,2) (1+i)^(N-2) (1-i)^(N-2) 2^1
        f = f * Mint(2).pow((Int)(N-2)*(N-3)/2 + (N-2) + 1);
// cerr<<"s="<<s<<" "<<__LINE__<<"> "<<f<<endl;
        ans = ans + f;
      }
    }
    ans = ans * Mint(4).pow(-N);
// cerr<<"ans = "<<ans<<endl;
    ans = ans * Mint(2).pow(-(Int)N*(N-1)/2);
    printf("%u\n", ans.x.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}