#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 998244353 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010

ll power(int k, int n, int M){
  if(n == 0) return 1;
  if(n == 1) return (ll)k;

  ll res = power(k, n/2, M);

  res = res * res % M;
  return n%2 == 1 ? res * k % M : res;
}

/* Starry Sky Tree */
//0-index

struct StarrySkyTree{
  typedef ll Type;
  int segn2;
  vector<Type> data, s_data;
  function<Type(Type, Type)> merge;

  StarrySkyTree(function<Type(Type, Type)> merge, int n): merge(merge)
  {
    for(segn2=1; segn2<n; segn2*=2);
    data.assign(segn2*2, 0);
    s_data.assign(segn2*2, 0);
  }

  StarrySkyTree(int n): //Original Ver.
    StarrySkyTree([](Type a, Type b){ return (a + b) % mod; }, n) {}

  //get value of [a,b)
  Type query(int a, int b, int l = 0, int r = -1, int k = 0){
    if(r == -1) r = segn2;
    if(r <= a || b <= l) return 0; //大きさに注意
    if(a <= l && r <= b) return (data[k] + s_data[k] * (r - l) % mod) % mod;
    return
      (merge(query(a, b, l, (l+r)/2, k*2+1), query(a, b, (l+r)/2 , r, k*2+2)) +
      s_data[k] * max(0, min(b, r) - max(a, l)) % mod) % mod;
  }

  //add x to [a,b)
  Type add(int a, int b, Type x, int l = 0, int r = -1, int k = 0){
    if(r == -1) r = segn2;
    if(a <= l && r <= b) {
      s_data[k] += x;
      s_data[k] %= mod;
    } else if(a < r && l < b) {
      data[k] = merge(add(a, b, x, l, (l+r)/2, k*2+1), add(a, b, x, (l+r)/2, r, k*2+2));
    }

    return (data[k] + s_data[k] * (r - l)) % mod;
  }

};


int main(){
  int N, K, A;
  ll ans = 0;

  cin >> N >> K >> A;

  ll initEnvN = power(N, mod - 2, mod) % mod;
  ll invN = A * power(N * 100, mod - 2, mod) % mod;

  StarrySkyTree seg(K+1);

  int r = min(1+N, K);
  seg.add(1, r, initEnvN);
  ans += max(0, N+1 - r) * initEnvN;

  for(int i=1; i<K; i++) {
    ll p = seg.query(i, i+1);

    int r = min(i+N+1, K);
    seg.add(i+1, r, invN * p % mod);
    ans += max(0, i+N+1 - r) * invN % mod * p % mod;
    ans %= mod;
  }

  cout << ans << endl;

  return 0;
}

