#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, b;
  cin >> n >> b;
  mint::set_mod(b);
  vector<array<mint, 2>> dp(1 << n);
  vector<mint> a(n);
  dp[0][0] = 1;
  rep(i, n) {
    rep(j, n) {
      ll x;
      cin >> x;
      a[j] = x;
    }
    if (i == 0) {
      rep(j, n) dp[1 << j][0] = a[j];
      continue;
    }
    int x, y;
    for (int T = (1 << i) - 1; T < (1 << n); x = T & -T, y = T + x, T = (((T & ~y) / x) >> 1) | y) {
      int p = 0;
      rrep(j, n) {
        if (T >> j & 1) {
          p ^= 1;
        } else {
          rep(k, 2) dp[T | (1 << j)][k ^ p] += dp[T][k] * a[j];
        }
      }
    }
  }
  cout << dp.back()[1].val() << '\n';
}