ll@n,@b,@a[n][n];
modint().setmod(b);
modint d[1<<n][2];
d[0][0]=1;
d[0][1]=0;
rep(i,1<<n){
	ll c=__builtin_popcount(i);
	rep(j,n){
		if(!(i&1<<j)){
			ll p=__builtin_parity(i&-(1<<j));
			d[i|1<<j][0^p]+=d[i][0]*a[c][j];
			d[i|1<<j][1^p]+=d[i][1]*a[c][j];
		}
	}
}
wt(d[(1<<n)-1][1]);