#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int x, k; cin >> x >> k;
	mint p = mint::raw(x) / 100;
	mint q = 1 - p;
	// now,max
	int k2 = 2 * k;
	vector dp(k2 + 1, vector(k2 + 1, vector<mint>(k2 + 1)));
	dp[0][0][0] = 1;
	rep(i, k2) rep(j, k2 + 1) rep(k, k2 + 1) {
		int ni = i + 1;
		int nj = j + 1;
		int nk = max(k, nj);
		if (nj >= 0 && nj <= k2 && nk >= 0 && nk <= k2) {
			dp[ni][nj][nk] += dp[i][j][k] * p;
		}
		nj = j - 1;
		nk = max(k, nj);
		if (nj >= 0 && nj <= k2 && nk >= 0 && nk <= k2) {
			dp[ni][nj][nk] += dp[i][j][k] * q;
		}
	}
	mint ans = 0;
	rep(i, k2 + 1)ans += dp[k2][0][i] * i;
	cout << ans.val() << endl;
	return 0;
}