// ACPC_AIZUDAI_DROPOUT
// coder : naan

#include <bits/stdc++.h>

int main(){
    using namespace std;
    constexpr unsigned long MOD = 998244353, percent = 828542813;
    const auto f = [&MOD](unsigned long a){
        unsigned long ret = 1, n = MOD - 2;
        while(n){
            if(n & 1)(ret *= a) %= MOD;
            (a *= a) %= MOD;
            n >>= 1;
        }
        return ret;
    };
    unsigned long N, K, A;
    cin >> N >> K >> A;
    (A *= percent) %= MOD;
    unsigned long M = N + K + 1, Ninv = f(N);
    vector<unsigned long> dp(M), sum(M);
    fill(dp.begin(), dp.end(), 1);
    partial_sum(dp.begin(), dp.end(), sum.begin());
    for(unsigned long i = N + 1; i < M; ++i){
        dp[i] = (A * (sum[i - 1] + MOD - sum[i - N - 1]) % MOD) * Ninv % MOD;
        sum[i] = (sum[i - 1] + dp[i]) % MOD;
    }
    cout << (dp.back() * f(A)) % MOD << endl;
    return 0;
}
