#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 1000000000000000001 int main(){ mint p; int K; { int x; cin>>x; p = x; p /= 100; } cin>>K; if(K>10)return 0; vector dp(K+1,vector(K+1,0)); dp[0][0] = 1; rep(i,K*2){ vector ndp(K+1,vector(K+1,0)); rep(j,K+1){ rep(k,K+1){ { mint nv = dp[j][k] * p; int nj = j+1; int nk = max(k,nj); if(nj<=K)ndp[nj][nk] += nv; } { mint nv = dp[j][k] * (1-p); int nj = j-1; int nk = max(k,nj); if(nj>=0)ndp[nj][nk] += nv; } } } swap(dp,ndp); } mint ans = 0; rep(i,K+1){ ans += dp[0][i] * i; } cout<