#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector <ll> poly;const int N = 1e7 + 5;
const int M = 1e5 + 5;int n, m, s;
ll w[M], fac[N], ifac[N], f[M], g[M], sum[M];inline void deb(poly c) {for (int i = 0; i < (int)c.size(); i++)printf("%lld%c", c[i], " \n"[i == (int)c.size() - 1]);
}namespace Poly {const int L = 1 << 18;const ll P = 1004535809LL;int lim, pos[L];template <typename T>inline void inc(T &x, T y) {x += y;if (x >= P) x -= P;}template <typename T>inline void sub(T &x, T y) {x -= y;if (x < 0) x += P;}inline void reverse(poly &c) {for (int i = 0, j = (int)c.size() - 1; i < j; i++, j--) swap(c[i], c[j]);}inline ll fpow(ll x, ll y) {ll res = 1;for (; y > 0; y >>= 1) {if (y & 1) res = res * x % P;x = x * x % P;}return res;}inline void prework(int len) {int l = 0;for (lim = 1; lim < len; lim <<= 1, ++l);for (int i = 0; i < lim; i++)pos[i] = (pos[i >> 1] >> 1) | ((i & 1) << (l - 1));}inline void ntt(poly &c, int opt) {c.resize(lim, 0);for (int i = 0; i < lim; i++)if (i < pos[i]) swap(c[i], c[pos[i]]);for (int i = 1; i < lim; i <<= 1) {ll wn = fpow(3, (P - 1) / (i << 1));if (opt == -1) wn = fpow(wn, P - 2);for (int len = i << 1, j = 0; j < lim; j += len) {ll w = 1;for (int k = 0; k < i; k++, w = w * wn % P) {ll x = c[j + k], y = c[j + k + i] * w % P;c[j + k] = (x + y) % P, c[j + k + i] = (x - y + P) % P;}}}if (opt == -1) {ll inv = fpow(lim, P - 2);for (int i = 0; i < lim; i++) c[i] = c[i] * inv % P;}}inline poly mul(const poly x, const poly y) {poly u = x, v = y, res;prework(x.size() + y.size() - 1);ntt(u, 1), ntt(v, 1);for (int i = 0; i < lim; i++) res.push_back(u[i] * v[i] % P);ntt(res, -1);res.resize(x.size() + y.size() - 1);return res;}}using Poly :: P;
using Poly :: fpow;
using Poly :: mul;
using Poly :: inc;
using Poly :: reverse;template <typename T>
inline void read(T &X) {X = 0; char ch = 0; T op = 1;for (; ch > '9'|| ch < '0'; ch = getchar())if (ch == '-') op = -1;for (; ch >= '0' && ch <= '9'; ch = getchar())X = (X << 3) + (X << 1) + ch - 48;X *= op;
}inline void prework(int len) {fac[0] = 1;for (int i = 1; i <= len; i++) fac[i] = fac[i - 1] * i % P;ifac[len] = fpow(fac[len], P - 2);for (int i = len - 1; i >= 0; i--) ifac[i] = ifac[i + 1] * (i + 1) % P;
}inline ll getC(int x, int y) {return fac[x] * ifac[y] % P * ifac[x - y] % P;
}int main() {read(n), read(m), read(s);for (int i = 0; i <= m; i++) read(w[i]);int rep = min(m, n / s);prework(max(n, m));for (int i = 0; i <= rep; i++) f[i] = getC(m, i) * getC(n, i * s) % P * fac[i * s] % P * fpow(ifac[s], i) % P * fpow(m - i, n - i * s) % P;/*    for (int i = 0; i <= rep; i++)printf("%lld%c", f[i], " \n"[i == rep]);     */poly a, b;a.resize(rep + 1, 0), b.resize(rep + 1, 0);for (int i = 0; i < rep + 1; i++) {a[i] = f[i] * fac[i] % P;b[i] = ifac[i];if (i & 1) b[i] = (P - b[i]) % P;} reverse(b);//    deb(a), deb(b);
    poly c = mul(a, b);//    deb(c);/*    for (int i = rep; i >= 0; i--) {sum[i] = sum[i + 1];inc(sum[i], c[i]);}   for (int i = 0; i <= rep; i++)printf("%lld%c", sum[i], " \n"[i == rep]);    */ ll ans = 0;for (int i = 0; i <= rep; i++) {g[i] = ifac[i] * c[rep + i] % P;inc(ans, w[i] * g[i] % P);}printf("%lld\n", ans);return 0;
}