#include <cstdio>

using namespace std;

typedef long long ll;

int P;

const int N = 1010;

int a[N];

int pow(int x, int k) {
  int ret = 1;
  while (k) {
    if (k & 1) ret = ret * (ll)x % P;
    k >>= 1;
    x = x * (ll)x % P;
  }
  return ret;
}

int main() {

//  freopen("test.in", "r", stdin);

  int n, x, m;

  scanf("%d%d%d%d", &n, &x, &P, &m);
  x %= P;

  int ans = 0;

  for (int i = 0; i <= m; ++i) {
    if (i == 0) a[0] = 1;
    else {
      // (1+xu)^(n-j) u^j
      for (int j = i - 1; j >= 0; --j) {
        a[j + 1] = (a[j + 1] + a[j] * (ll)x % P * (n - j)) % P;
        a[j] = a[j] * (ll)j % P;
      }
    }
    int pwr = pow((1 + x) % P, n - i);
    int coe;
    scanf("%d", &coe);
    coe %= P;
    for (int j = i; j >= 0; --j) {
      ans = (ans + pwr * (ll)a[j] % P * coe) % P;
      pwr = pwr * (1LL + x) % P;
    }
  }
  printf("%d\n", ans);

  return 0;
}