#include <bits/stdc++.h>
using namespace std;
long long n, m, d, a[1085], b[1085], f[1085];
int main () {
    freopen ("recurrences.in", "r", stdin);
    freopen ("recurrences.out", "w", stdout);
	for (;;) {
		cin >> d >> n >> m;
		if (d == 0 && n == 0 && m == 0) {
			return 0;
		}
		for (int i = 1; i <= d; i++) cin >> a[i], a[i] %= m;
		for (int i = 1; i <= d; i++) cin >> f[i], f[i] %= m;
		if (n <= d) {
		    cout << f[n] % m << endl;
        } else {
    		for (int i = d + 1; i <= n; i++) {
    		    f[d + 1] = 0;
    		    for (int j = 1; j <= d; ++j) {
    		        f[d + 1] += a[j] * f[d - j + 1] % m;
    		        f[d + 1] %= m;
                }
                for (int j = 1; j <= d; ++j) {
                    f[j] = f[j + 1];
                }
            }
            cout << f[d] % m<< endl;
        }
	}
	return 0;
}