#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(d,n) for(int d = 0; d < (int)(n); d++)
#define rrep(d,n) for(int d = (int)(n) - 1; d >= 0; d--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 20010;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int d = 1; d <= FACT_SIZE; ++d) {
        Fact[d] = Fact[d-1] * d;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int d = FACT_SIZE; d; --d) {
        iFact[d-1] = iFact[d] * d;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int x, k;
  cin >> x >> k;
  mint p = mint(x) / 100;
  mint ans;
  mint pre;
  for (int d = 0; d <= k; d++) {
    mint v;
    for (int i = 0; i <= k; i += d + 2) {
      v += comb(2 * k, k + i);
      v -= comb(2 * k, k + i + d + 1);
    }
    for (int i = 0; i <= k; i += d + 2) {
      v -= comb(2 * k, k + i + 1);
      v += comb(2 * k, k + i + d + 2);
    }
    ans += d * (v - pre);
    pre = v;
  }
  ans *= (p * (1 - p)).pow(k);
  cout << ans.val() << '\n';
}