// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
template<class T>
bool minimize(T &a, const T &b) {
if (a > b) return a = b, true;
return false;
}
template<class T>
bool maximize(T &a, const T &b) {
if (a < b) return a = b, true;
return false;
}
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "gravel"
const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 3e5 + 5;
const int MAX = 1e5 + 5;
int n, m, p, a[2][N], t[N], g[N], v[N];
bitset<MAX> dp[2];
int f[N];
void init(void) {
cin >> n >> m >> p;
REP(j, 2) FOR(i, 1, n) cin >> a[j][i];
FOR(i, 1, m) cin >> t[i];
FOR(i, 1, m) cin >> g[i];
FOR(i, 1, m) cin >> v[i];
}
void process(void) {
REP(j, 2) {
dp[j][0] = true;
FOR(i, 1, n) dp[j] |= dp[j] << a[j][i];
}
int res = 0;
FOR(i, 1, m) if (dp[0][t[i]] && dp[1][g[i]] == true) {
f[i] = (1LL * v[i] * f[i - 1] % p + v[i]) % p;
res = (res + f[i]) % p;
}
cout << res;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) {
init();
process();
}
return 0;
}
Ly8gfn4gaWNlYmVhciB+fgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBpbnQgbG9uZyBsb25nCnR5cGVkZWYgbG9uZyBsb25nIGxsOwp0eXBlZGVmIHBhaXI8aW50LCBpbnQ+IGlpOwp0eXBlZGVmIHBhaXI8aW50LCBpaT4gaWlpOwoKdGVtcGxhdGU8Y2xhc3MgVD4KICAgIGJvb2wgbWluaW1pemUoVCAmYSwgY29uc3QgVCAmYikgewogICAgICAgIGlmIChhID4gYikgcmV0dXJuIGEgPSBiLCB0cnVlOwogICAgICAgIHJldHVybiBmYWxzZTsKICAgIH0KCnRlbXBsYXRlPGNsYXNzIFQ+CiAgICBib29sIG1heGltaXplKFQgJmEsIGNvbnN0IFQgJmIpIHsKICAgICAgICBpZiAoYSA8IGIpIHJldHVybiBhID0gYiwgdHJ1ZTsKICAgICAgICByZXR1cm4gZmFsc2U7CiAgICB9CgojZGVmaW5lIEZPUihpLGEsYikgZm9yKGludCBpPShhKTsgaTw9KGIpOyArK2kpCiNkZWZpbmUgRk9SUihpLGEsYikgZm9yKGludCBpPShhKTsgaT49KGIpOyAtLWkpCiNkZWZpbmUgUkVQKGksIG4pIGZvcihpbnQgaT0wOyBpPChuKTsgKytpKQojZGVmaW5lIFJFRChpLCBuKSBmb3IoaW50IGk9KG4pLTE7IGk+PTA7IC0taSkKI2RlZmluZSBNQVNLKGkpICgxTEwgPDwgKGkpKQojZGVmaW5lIEJJVChTLCBpKSAoKChTKSA+PiAoaSkpICYgMSkKI2RlZmluZSBtcCBtYWtlX3BhaXIKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmaSBmaXJzdAojZGVmaW5lIHNlIHNlY29uZAojZGVmaW5lIGFsbCh4KSB4LmJlZ2luKCksIHguZW5kKCkKI2RlZmluZSB0YXNrICJncmF2ZWwiCgpjb25zdCBpbnQgTU9EID0gMWU5ICsgNzsKY29uc3QgaW50IGluZiA9IDFlOSArIDI3MDkyMDA4Owpjb25zdCBsbCBJTkYgPSAxZTE4ICsgMjcwOTIwMDg7CmNvbnN0IGludCBOID0gM2U1ICsgNTsKY29uc3QgaW50IE1BWCA9IDFlNSArIDU7CmludCBuLCBtLCBwLCBhWzJdW05dLCB0W05dLCBnW05dLCB2W05dOwpiaXRzZXQ8TUFYPiBkcFsyXTsKaW50IGZbTl07Cgp2b2lkIGluaXQodm9pZCkgewogICAgY2luID4+IG4gPj4gbSA+PiBwOwogICAgUkVQKGosIDIpIEZPUihpLCAxLCBuKSBjaW4gPj4gYVtqXVtpXTsKICAgIEZPUihpLCAxLCBtKSBjaW4gPj4gdFtpXTsKICAgIEZPUihpLCAxLCBtKSBjaW4gPj4gZ1tpXTsKICAgIEZPUihpLCAxLCBtKSBjaW4gPj4gdltpXTsKfQoKdm9pZCBwcm9jZXNzKHZvaWQpIHsKICAgIFJFUChqLCAyKSB7CiAgICAgICAgZHBbal1bMF0gPSB0cnVlOwogICAgICAgIEZPUihpLCAxLCBuKSBkcFtqXSB8PSBkcFtqXSA8PCBhW2pdW2ldOwogICAgfQogICAgaW50IHJlcyA9IDA7CiAgICBGT1IoaSwgMSwgbSkgaWYgKGRwWzBdW3RbaV1dICYmIGRwWzFdW2dbaV1dID09IHRydWUpIHsKICAgICAgICBmW2ldID0gKDFMTCAqIHZbaV0gKiBmW2kgLSAxXSAlIHAgKyB2W2ldKSAlIHA7CiAgICAgICAgcmVzID0gKHJlcyArIGZbaV0pICUgcDsKICAgIH0KICAgIGNvdXQgPDwgcmVzOwp9CgpzaWduZWQgbWFpbigpIHsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKICAgIGlmIChmb3Blbih0YXNrIi5pbnAiLCAiciIpKSB7CiAgICAgICAgZnJlb3Blbih0YXNrIi5pbnAiLCAiciIsIHN0ZGluKTsKICAgICAgICBmcmVvcGVuKHRhc2siLm91dCIsICJ3Iiwgc3Rkb3V0KTsKICAgIH0KICAgIGludCB0YyA9IDE7Ci8vICAgIGNpbiA+PiB0YzsKICAgIHdoaWxlKHRjLS0pIHsKICAgICAgICBpbml0KCk7CiAgICAgICAgcHJvY2VzcygpOwogICAgfQogICAgcmV0dXJuIDA7Cn0K