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

using mint = atcoder::modint998244353;

int main() {
    int x, k;
    cin >> x >> k;
    mint omote = mint(x) / mint(100), ura = mint(1) - omote;
    auto f = [&](int n) -> int {
        int a = 0, b = 0, res = 0;
        for (int i = 2 * k - 1; i >= 0; i--) {
            if (n & (1 << i)) {
                a++;
            } else {
                b++;
            }
            if (a < b) {
                return 0;
            }
            res = max(res, a - b);
        }
        return (a == b ? res : 0);
    };
    mint ans = 0;
    for (int bit = 0; bit < (1 << (2 * k)); bit++) {
        int d = f(bit);
        int a = __builtin_popcount(bit);
        int b = 2 * k - a;
        ans += mint(d) * omote.pow(a) * ura.pow(b);
    }
    cout << ans.val() << endl;
}