#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll n, k, mod;
ll a[4][200005];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k >> mod;
	rep(i, 0, 3){
		rep(j, 1, n){
			cin >> a[i][j];
		}
		sort(a[i]+1, a[i]+n+1);
	}
	
	ll ans = 0;
	rep(i, 1, n){
		ll mn = inf, mx = -inf;
		rep(j, 0, 3) chmax(mx, a[j][i]), chmin(mn, a[j][i]);
		ans += modpow(mx-mn, k), ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}