#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, B;
  cin >> N >> B;
  vector<vector<long long>> A(N, vector<long long>(N));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < N; j++){
      cin >> A[i][j];
      A[i][j] %= B;
    }
  }
  vector<vector<long long>> dp(2, vector<long long>(1 << N, 0));
  dp[0][0] = 1;
  for (int i = 0; i < (1 << N); i++){
    int p = __builtin_popcount(i);
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < N; k++){
        if ((i >> k & 1) == 0){
          int i2 = i | (1 << k);
          int j2 = j ^ __builtin_parity(i >> k);
          dp[j2][i2] += dp[j][i] * A[p][k] % B;
          dp[j2][i2] %= B;
        }
      }
    }
  }
  cout << dp[1][(1 << N) - 1] << endl;
}