#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    
    ll N, B, M, x, c, d;
    cin >> N >> B;
    vector<vector<ll>> A(N, vector<ll>(N));
    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++){
            cin >> A[i][j];
            A[i][j] %= B;
        }
    }

    M = 1<<N;
    vector<vector<ll>> dp(M, vector<ll>(2));
    dp[0][0] = 1;

    for (int i=0; i<N; i++){
        x = M-1 - ((1<<i)-1);
    }

    
    for (int i=0; i<M; i++){
        for (int j=0; j<N; j++){
            if (i & 1<<j) continue;
            x = M-1 - ((1<<j)-1);
            c = __builtin_popcount(x & i); //(x以上のものでiに含まれるものの数)
            d = __builtin_popcount(i); //(iに含まれるものの要素数)
            for (int k=0; k<2; k++){
                dp[i|(1<<j)][(k+c)%2] += (dp[i][k] * A[d][j]) % B;
                dp[i|(1<<j)][(k+c)%2] %= B;
            }
        }
    }

    cout << dp[M-1][1] << endl;

    return 0;
}