#include<bits/stdc++.h>
using namespace std;

#define pb emplace_back
#define mp make_pair
 
using ll = long long;
using pii = pair<int,int>;
 
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr int N = 2e5 + 10;

ll pow_mod(ll x, ll p){
  ll s = 1;
  while(p){
    if(p & 1) s = s * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return s;
}

void add(int &x, int y){
  x += y;
  if(x >= mod)  x -= mod;
}

int dp[30][30][30];

void _main(){
  int x, K;
  cin >> x >> K;
  if(K > 10){
    cout << "0\n";
    return;
  }
  ll p = pow_mod(100, mod - 2) * x % mod;
  ll q = (1 + mod - p) % mod;
  dp[0][0][0] = 1;
  K <<= 1;
  for(int i=0; i<K; ++i){
    for(int j=0; j<=i; ++j){
      for(int k=0; k<=j; ++k){
        add(dp[i+1][max(j, k + 1)][k + 1], 1ll * dp[i][j][k] * p % mod);
        if(k){
          add(dp[i+1][j][k - 1], 1ll * dp[i][j][k] * q % mod);
        }
      }
    }
  }
  ll ans = 0;
  for(int i=1; i<=K; ++i){
    ans += 1ll * dp[K][i][0] * i % mod;
  }
  cout << ans % mod << '\n';
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  _main();
  return 0;
}