#include <bits/stdc++.h>
using namespace std;
int n , k , m;
const int mod = 998244353;
int p[105];
int q[105];
int qpow(int a,int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = 1LL * ans * a %mod;
        a = 1LL * a * a % mod ;b >>= 1;
    }
    return ans;
}
const int N = 1e7 + 5;
int inv[N];
int G[N];
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    cin >> n >> k >> m;
    for(int i = 0;i <= k;i++) {
        double g ; cin >> g;
        p[i] = round(g * 10000) ;
        p[i] = 1LL * p[i] * qpow(10000 , mod - 2) % mod;
    }
    for(int i = 1;i <= k;i++) q[i - 1] = 1LL * p[i] * i % mod;

    inv[1] = 1;
    for(int i = 2;i <= m + 1;i++) inv[i] = 1LL * inv[mod % i] * (mod - mod / i) % mod;
    
    G[0] = qpow(p[0] , n) ;
    int qp = qpow(p[0] , mod - 2);

    int ans = 0;
    int f = G[0];
    for(int i = 0; i + 1 < m ;i++) {
        for(int j = 0 ; j <= k - 1 && j <= i;j++) {
            G[i + 1] = (G[i + 1] + 1LL * G[i - j] * q[j]) % mod;
        }
        G[i + 1] = 1LL * G[i + 1] * n % mod;
        for(int j = 1;j <= k && j <= i + 1;j++) {
            G[i + 1] = (G[i + 1] - 1LL * G[i - j + 1] * p[j] % mod * (i - j + 1) % mod + mod) % mod;
        }
        G[i + 1] = 1LL * G[i + 1] * inv[i + 1] % mod * qp % mod;

        ans = (ans + 1LL * G[i + 1] * (i + 1)) % mod;
        f = (f + G[i + 1]) % mod;
    }
    f = (1 - f + mod) % mod;
    ans = (ans + 1LL * m * f ) % mod;
    cout << ans << '\n';
}