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

using mint = modint998244353;

int main(void) {
	int ix, k;
	cin >> ix >> k;

	int k2 = k * 2;

	mint x = ix;
	mint ans = 0;
	int depth = -1, cur = -1;
	for (int bit = 0; bit < (1 << k2); bit++) {
		depth = 0;
		cur = 0;

		bool flag = true;
		for (int i = 0; i < k2; i++) {
			if (bit & (1 << i)) {
				cur++;
				depth = max(depth, cur);
			}
			else {
				cur--;
				if (cur < 0) flag = false;
			}
		}

		if (cur == 0 && flag) {
			ans += (mint)depth;
		}
	}

	ans *= (x.pow(k) * ((mint)100 - x).pow(k));
	for (int i = 0; i < k2; i++) ans /= (mint)100;

	cout << ans.val() << endl;

	return 0;
}