#include <bits/stdc++.h>   using namespace std;   template <class T>   inline T bigmod(T p, T e, T M) {     T ret = 1;     for (; e > 0; e >>= 1) {       if (e & 1) ret = (ret * p) % M;       p = (p * p) % M;     }     return (T)ret;   }   template <class T>   inline T gcd(T a, T b) {     if (b == 0) return a;     return gcd(b, a % b);   }   template <class T>   inline T modinverse(T a, T M) {     return bigmod(a, M - 2, M);   }   template <class T>   inline T lcm(T a, T b) {     a = abs(a);     b = abs(b);     return (a / gcd(a, b)) * b;   }   template <class T, class X>   inline bool getbit(T a, X i) {     T t = 1;     return ((a & (t << i)) > 0);   }   template <class T, class X>   inline T setbit(T a, X i) {     T t = 1;     return (a | (t << i));   }   template <class T, class X>   inline T resetbit(T a, X i) {     T t = 1;     return (a & (~(t << i)));   }   inline long long power(long long a, long long b) {     long long multiply = 1;     for (int i = (1); i <= (b); i++) {       multiply *= a;     }     return multiply;   }   inline long long ABS(long long a) { return (a >= 0) ? a : -a; }   long long n, in, m;   map<long long, vector<long long> > mp;   pair<long long, long long> fact[200003];   int main() {     scanf( %lld , &n);     for (int i = (1); i <= (n); i++) {       scanf( %lld , &in);       mp[in].push_back(i);     }     for (int i = (1); i <= (n); i++) {       scanf( %lld , &in);       mp[in].push_back(i);     }     scanf( %lld , &m);     fact[0] = make_pair(1, 0);     long long ans = 1, cnt, temp;     for (long long i = (1); i <= (200000); i++) {       temp = i;       cnt = 0;       while (temp % 2 == 0) {         temp /= 2;         cnt++;       }       fact[i].first = (fact[i - 1].first * temp) % m;       fact[i].second = cnt + fact[i - 1].second;     }     vector<long long> v;     for (__typeof((mp).begin()) it = (mp).begin(); it != (mp).end(); it++) {       v = it->second;       if (v.size() == 1) continue;       sort(v.begin(), v.end());       ans *= fact[v.size()].first;       ans %= m;       cnt = 0;       for (int i = (1); i <= (v.size() - 1); i++) {         if (v[i] == v[i - 1]) cnt++;       }       ans *= bigmod(2LL, fact[v.size()].second - cnt, m);       ans %= m;     }     cout << ans <<   n ;     return 0;   }   