import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K,M = MI()
P = LI()
E = LI()
A = LI()
H = LI()
P.sort()
E.sort()
A.sort()
H.sort()

ans = 0
for i in range(N):
    p,e,a,h = P[i],E[i],A[i],H[i]
    ans += pow(max(p,e,a,h)-min(p,e,a,h),K,M)
    ans %= M

print(ans)