#include <cstdio>
#include <algorithm>
long long mod = -1;

long long power(long long a,long long b){
    long long res = 1;
    while(b){
        if(b%2) res = res*a%mod;
        a = a*a%mod;
        b /= 2;
    }
    return res;
}

long long a[4][200005];

int main(){
    int n,k;
    scanf("%d%d%lld",&n,&k,&mod);
    for(int i = 0; i < 4; i++){
        for(int j = 1; j <= n; j++) scanf("%lld",&a[i][j]);
        std::sort(a[i]+1,a[i]+1+n);
    }
    long long ans = 0;
    for(int i = 1; i <= n; i++){
        long long minn = a[0][i], maxn = a[0][i];
        for(int j = 1; j < 4; j++){
            if(minn>a[j][i]) minn = a[j][i];
            if(maxn<a[j][i]) maxn = a[j][i]; 
        }
        ans += power(maxn-minn,k);
        if(ans >= mod) ans -= mod;
    }
    printf("%lld\n",ans);
    return 0;
}