def solve():
    from itertools import permutations

    N,B=map(int,input().split())
    A=[None]*3

    for i in range(3):
        A[i]=list(map(int,input().split()))

    def sgn(P):
        k=0
        for i in range(len(P)):
            for j in range(i):
                if P[j]>P[i]:
                    k+=1
        return -1 if k%2 else 1

    def det(A):
        d=0
        for P in permutations(range(3)):
            P0,P1,P2=P
            d+=sgn(P)*A[0][P0]*A[1][P1]*A[2][P2]
        return d

    return pow(abs(det(A)), N, B)

#==================================================
print(solve())