# include <bits/stdc++.h>
# define int long long
using namespace std;
const int M = 2005; 
using i64 = long long; 
i64 n, x, mod; int m; 
i64 a[M], S2[M][M], fac[M], xjm[M], p1x[M]; 
i64 qpow(i64 x, i64 p = mod - 2ll)
{
    i64 ans = 1ll; 
    while(p) 
    {
        if(p & 1) ans = ans * x % mod; 
        x = x * x % mod, p >>= 1; 
    }
    return ans; 
}

void Add(i64 &x, i64 y) { x = (x + y) % mod; if(x < 0) x += mod; return; }
void Init(int n = M - 5)
{
    S2[0][0] = 1, fac[0] = 1ll, xjm[0] = 1ll; 
    for(int k = 1; k <= min(n, m); k++) {xjm[k] = xjm[k - 1] * (::n - k + 1ll) % mod; }
    p1x[min(::n, m)] = qpow(1ll + x, ::n - min(::n, m)); 
    for(int i = min(::n, m) - 1; i >= 0; i--) p1x[i] = p1x[i + 1] * (1ll + x) % mod; 
    for(int i = 1; i <= n; i++) 
    {
        for(int j = 1; j <= i; j++) 
        {
            S2[i][j] = (S2[i - 1][j - 1] + j * S2[i - 1][j] % mod) % mod; 
        }
        fac[i] = fac[i - 1] * 1ll * i % mod; 
    }
    return; 
}
signed main(void)
{
    scanf("%lld%lld%lld%lld", &n, &x, &mod, &m); 
    Init(); 
    for(int i = 0; i <= m; i++) scanf("%lld", &a[i]); 
    i64 Ans = 0; 
    for(int i = 0; i <= m; i++)
    {
        i64 px = 1ll; 
        for(int j = 0; j <= i; j++, px = px * x % mod)
        {
            assert(px == 1ll); 
            Add(Ans, a[i] * xjm[j] % mod * px % mod * p1x[j] % mod * S2[i][j] % mod); 
        }
    }
    printf("%lld\n", Ans); 
    return 0; 
}