#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Comb
{
  int siz, mod;
  std::vector<long long> _fac, _inv, _finv;
public:
  // 引数は (mod)
  Comb(int m) : mod(m), siz(2)
  {
    _fac.resize(siz);
    _inv.resize(siz);
    _finv.resize(siz);
    _fac[0] = _fac[1] = _inv[1] = _finv[0] = _finv[1] = 1;
  }
  long long p(int n, int k)
  {
    if (n < k || k < 0) return 0;
    resize(n + 1);
    return _fac[n] * _finv[n - k] % mod;
  }
  long long c(int n, int k)
  {
    if (n < k || k < 0) return 0;
    resize(n + 1);
    return _fac[n] * _finv[k] % mod * _finv[n - k] % mod;
  }
  long long inv(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _inv[n];
  }
  long long fac(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _fac[n];
  }
  long long finv(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _finv[n];
  }
private:
  void resize(int n)
  {
    if (n <= siz) return;
    for (int i = siz; i < n; ++i)
    {
      _fac.push_back((long long)i * _fac[i - 1] % mod);
      _inv.push_back(mod - _inv[mod % i] * (mod / i) % mod);
      _finv.push_back(_finv[i - 1] * _inv[i] % mod);
    }
    siz = n;
  }
};

long long pow(long long a, long long k, long long m)
{
  long long ret = 1;
  for (a %= m; k > 0; k >>= 1, a = a * a % m) if (k & 1) ret = ret * a % m;
  return ret;
}

int main()
{
  const int mod = 998244353;
  int x, k;
  cin >> x >> k;
  --k;
  Comb cb(mod);
  vector<long long> cnt(k + 1);
  long long inv = pow(100, mod - 2, mod);
  for (int i = 0; i <= k; ++i)
  {
    int tmp = k + 3 - i;
    for (int j = -k; j <= k; ++j) cnt[i] = (cnt[i] + cb.c(2 * k, k + j * tmp) - cb.c(2 * k, i - 1 + j * tmp) + mod) % mod;
  }
  long long ans = 1;
  for (int i = 0; i < k; ++i) ans = (ans + (cnt[i] - cnt[i + 1] + mod) * (k - i + 1)) % mod;
  long long p = x * pow(100, mod - 2, mod) % mod;
  ans = ans * pow(p, k + 1, mod) % mod * pow(mod + 1 - p, k + 1, mod) % mod;
  cout << ans << endl;
}