#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
struct fenwick_tree {
	ll n;
	vll bit;
	fenwick_tree(ll num) :bit(num + 1, 0) { n = num; }

	void add(ll i, ll w) {
		for (ll x = i+1; x <= n; x += x & -x) {
			bit[x-1] += w;
		}
	}

	ll sum(ll i) {
		ll ret = 0;
		for (ll x = i+1; x > 0; x -= x & -x) {
			ret += bit[x-1];
		}
		return ret;
	}

	ll sum(ll L, ll R) {
		return sum(R) - sum(L);
	}


};
ll TE(vll A) {
	ll res = 0;
	ll N = A.size();
	fenwick_tree fw(N);
	rep(i, N) {
		res += i - fw.sum(A[i]-1);
		fw.add(A[i], 1);
	}
	return res;
}
ll modPow(long long a, long long n, long long p) {
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % p;
  if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
  long long t = modPow(a, n / 2, p);
  return (t * t) % p;
}
int main() {

    ll N,K,M;
    cin>>N>>K>>M;
    vector<vll> A(4,vll(N));
    rep(i,4)rep(n,N)cin>>A[i][n];
    rep(i,4)sort(all(A[i]));
    ll AN=0;
    rep(i,N){
        ll Ma=max({A[0][i],A[1][i],A[2][i],A[3][i]});
        ll m=min({A[0][i],A[1][i],A[2][i],A[3][i]});
        ll d=Ma-m;
        //cout<<d<<endl;
        AN+=modPow(d,K,M);
        //cout<<AN<<endl;
        AN%=M;
    }
    cout<<AN<<endl;

}