import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
def popcnt3(n):
    c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)
    return c
n, mod = na()
a = [na() for i in range(n)]
dp0 = [0] * (1<<n)
dp1 = [0] * (1<<n)
dp0[0] = 1
t = [((1 << n) - (1 << j)) for j in range(n)]
for i in range(1<<n):
    pc = popcnt3(i)
    for j in range(n):
        if i >> j & 1:
            continue
        c = popcnt3(i & t[j])
        if c % 2:
            dp0[i | (1<<j)] += dp1[i] * a[pc][j] % mod
            dp0[i | (1<<j)] %= mod
            dp1[i | (1<<j)] += dp0[i] * a[pc][j] % mod
            dp1[i | (1<<j)] %= mod
        else:
            dp0[i | (1<<j)] += dp0[i] * a[pc][j] % mod
            dp0[i | (1<<j)] %= mod
            dp1[i | (1<<j)] += dp1[i] * a[pc][j] % mod
            dp1[i | (1<<j)] %= mod
#print(dp0, dp1)
print(dp1[-1])