#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
using ll=long long;

ll powmod(ll base,ll exp,ll mod){
    ll cnt=0;
    ll texp=exp;
    while(texp){cnt++;texp/=2;}
    vector<ll> dp(cnt,0);
    dp[0]=base%mod;
    for(ll i=1;i<cnt;i++){
        dp[i]=(dp[i-1]*dp[i-1])%mod;
    }
    ll ans=1;
    for(ll i=0;i<cnt;i++){
        if((exp>>i)&1){
            ans*=dp[i];
            ans%=mod;
        }
    }
    return ans;
}
int main(){
    ll n,k,m;
    cin>>n>>k>>m;
    vector<priority_queue<ll>> q(4);
    ll ans=0;

    for(int i=0;i<4;i++){
        for(int j=0;j<n;j++){
            ll tmp;
            cin>>tmp;
            q[i].push(tmp);
        }
    }

    for(int i=0;i<n;i++){
        ll ma=0,mi=1000000000;
        for(int j=0;j<4;j++){
            ll tmp=q[j].top();q[j].pop();
            ma=max(ma,tmp);
            mi=min(mi,tmp);
        }
        ans+=powmod(ma-mi,k,m);
        ans%=m;
    }
    cout<<ans<<endl;

    return 0;
}