#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
ll qpow(ll a, ll b) {
    ll res = 1;
    for (; b; b >>= 1, a = a * a % mod)
        if (b & 1) res = res * a % mod;
    return res;
}
const int M = 10000005;
int n, k, m;
ll p[105], inv[M], q[M];
int main() {
    /*
    Q(x)=P(x)^n, Q'(x)=nP(x)^{n-1}P'(x), Q'(x)P(x)=nP(x)^nP'(x);
    */
    cin >> n >> k >> m;
    inv[1] = 1;
    for (int i = 2; i <= m; i++)
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    int t = qpow(10000, mod - 2);
    for (int i = 0; i <= k; i++) {
        double x;
        cin >> x;
        p[i] = x * 10000 + 0.5;
        p[i] = p[i] * t % mod;
    }
    q[0] = qpow(p[0], n);
    t = qpow(p[0], mod - 2);
    for (int i = 0; i < m; i++) {
        ll l = 0, r = 0;
        for (int j = 1; j <= i && j <= k; j++)
            l = (l + p[j] * (i - j + 1) % mod * q[i - j + 1] % mod) % mod;
        for (int j = 0; j <= i && j + 1 <= k; j++)
            r = (r + (j + 1) * p[j + 1] % mod * q[i - j] % mod) % mod;
        r = r * n % mod;
        q[i + 1] = (r - l + mod) % mod * t % mod * inv[i + 1] % mod;
    }
    ll ans = 0, sum = 1;
    for (int i = 0; i < m; i++) {
        ans = (ans + q[i] * i % mod) % mod;
        sum = (sum - q[i] + mod) % mod;
    }
    ans = (ans + sum * m % mod) % mod;
    cout << ans << endl;
    return 0;
}