#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;

long long modpow(long long x, long long n,long long m) {
    long long ret = 1;
    x %= m;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % m;  
        x = (x * x) % m;
        n >>= 1; 
    }
    return ret;
}

vector<ll> a[4];

int main(){
    ll n,k,m;
    cin >> n >> k >> m;
    rep(i,4) a[i].resize(n);
    rep(i,4)rep(j,n) cin >> a[i][j];
    rep(i,4) sort(a[i].begin(),a[i].end());
    ll ans = 0;
    rep(i,n){
        ll mn = LINF;
        ll mx = -LINF;
        rep(j,4){
            chmin(mn,a[j][i]);
            chmax(mx,a[j][i]);
        }
        ans += modpow(mx-mn,k,m);
        ans %= m;
    }
    cout << ans << endl;
    return 0;
}