import sys
import math
import collections


# sys.setrecursionlimit(10000001)
INF = 10 ** 20
# MOD = 10 ** 9 + 7
MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))


# ===CODE===
def main():
    n, k, m = ns()
    a = na()
    b = na()
    c = na()
    d = na()
    a.sort()
    b.sort()
    c.sort()
    d.sort()

    diff = []
    for ai, bi, ci, di in zip(a, b, c, d):
        tmp = max(ai, bi, ci, di)-min(ai, bi, ci, di)
        diff.append(tmp)
    diff.sort()

    ans = 0
    for i, di in enumerate(diff):
        ans += pow(di, k, m)
        ans %= m
    print(ans)


if __name__ == '__main__':
    main()