#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

int main() {
    fast_io();
    int n;
    long long 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(1 << n, vector<long long>(2));
    dp[0][0] = 1;
    for (int st = 0; st < (1 << n); st++) {
        int p = __builtin_popcount(st);
        for (int i = 0; i < n; i++) {
            if ((st >> i) & 1) {
                continue;
            }
            int is_odd = 0;
            for (int j = 0; j < i; j++) {
                if (((st >> j) & 1) == 0) {
                    is_odd ^= 1;
                }
            }
            dp[st | (1 << i)][is_odd] += dp[st][0] * a[i][p] % b;
            dp[st | (1 << i)][is_odd] %= b;
            dp[st | (1 << i)][is_odd ^ 1] += dp[st][1] * a[i][p] % b;
            dp[st | (1 << i)][is_odd ^ 1] %= b;
        }
    }
    cout << dp.back()[1] << "\n";
}