#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,K; ll mo; int A[4][202020]; ll modpow(ll a, ll n = mo-2) { ll r=1;a%=mo; while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1; return r; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>K>>mo; FOR(i,4) { FOR(j,N) cin>>A[i][j]; sort(A[i],A[i]+N); } ll ret=0; FOR(i,N) { int mi=min({A[0][i],A[1][i],A[2][i],A[3][i]}); int ma=max({A[0][i],A[1][i],A[2][i],A[3][i]}); ret+=modpow(ma-mi,K); } cout<