def oi(): return int(input())
def os(): return input()
def mi(): return list(map(int, input().split()))

# import sys
# input = sys.stdin.readline
# import sys
# sys.setrecursionlimit(10**8)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input_count = 0

input_count = 0
N,K,M = mi()

P = mi()
E = mi()
A = mi()
H = mi()
P.sort()
E.sort()
A.sort()
H.sort()
sums = 0
for _ in range(N):
    p = P.pop()
    e = E.pop()
    a = A.pop()
    h = H.pop()
    lists = [p,e,a,h]
    lists.sort()
    sums = (sums + pow(lists[-1]-lists[0], K,M) )%M
print(sums)