#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }

int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll a;
  cin>>a;
  ll k,m;
  cin>>k>>m;
  vector<ll> x1(a);
  vcin(x1);
  vector<ll> x2(a);
  vcin(x2);
  vector<ll> x3(a);
  vcin(x3);
  vector<ll> x4(a);
  vcin(x4);
  sor(x1);
  sor(x2);
  sor(x3);
  sor(x4);
  ll ans=0;
  for(int i=0;i<a;i++){
    ans+=modPow(max(max(x1[i],x2[i]),max(x3[i],x4[i]))-(min(min(x1[i],x2[i]),min(x3[i],x4[i]))),k,m);
    ans%=m;
  }
  cout<<ans<<endl;
}