#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1010;
int n, x, p, m, a[N];

int ksm(int s, int k) {
    int res = 1;
	while (k != 0) {
        if (k % 2 == 1) res = res * s % p;
        s = s * s % p;
        k /= 2;
    }
    return res % p;
}

signed main() {
	freopen("problem.in", "r", stdin);
	freopen("problem.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> x >> p >> m;
	for (int i = 0; i <= m; i++) cin >> a[i];
	cout << a[0] % p * ksm(x + 1, n) % p;
	return 0;
}