/* -*- coding: utf-8 -*-
 *
 * 1359.cc:  No.1359 [Zelkova 3rd Tune] 四人セゾン - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int L = 4;

/* typedef */

typedef long long ll;

/* global variables */

int as[L][MAX_N];

/* subroutines */

inline int powmod(int a, int n, int mod) {  // a^n % mod
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % mod;
    a = (ll)a * a % mod;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);

  for (int i = 0; i < L; i++) {
    for (int j = 0; j < n; j++) scanf("%d", as[i] + j);
    sort(as[i], as[i] + n);
  }

  int sum = 0;
  for (int j = 0; j < n; j++) {
    int mina = as[0][j], maxa = as[0][j];
    for (int i = 1; i < L; i++)
      mina = min(mina, as[i][j]), maxa = max(maxa, as[i][j]);

    sum = (sum + powmod(maxa - mina, k, m)) % m;
  }

  printf("%d\n", sum);
  return 0;
}