#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll powmod(ll a, ll k, ll MOD){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
int main()
{
    int n, k, m; cin>>n>>k>>m;
    ll p[4][200020];
    for(int i=0; i<4; i++){
        for(int j=0; j<n; j++) cin>>p[i][j];
        sort(p[i], p[i]+n);
    }
    ll ans=0;
    for(int i=0; i<n; i++){
        ll mn=min({p[0][i], p[1][i], p[2][i], p[3][i]});
        ll mx=max({p[0][i], p[1][i], p[2][i], p[3][i]});
        ans+=powmod((mx-mn)%m, k, m);
        ans%=m;
    }
    cout<<ans<<endl;
    return 0;
}