#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(v) v.begin(),v.end()
#define dbg(x) cerr << #x << ": " << (x) << endl;
template<class F, class S>
ostream& operator<<(ostream& os, pair<F,S>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<class Iter>
void print(Iter beg, Iter end) {
    for (Iter itr = beg; itr != end; ++itr) {
        cerr << *itr << ' ';
    }
    cerr << '\n';
}
ll x,k;
ll mod = 998244353;
ll modpow(ll x, ll n, ll mod) {
    x %= mod;
    ll res = 1;
    while (n > 0) {
        if (n&1) res = res*x%mod;
        x = x*x%mod;
        n >>= 1;
    }
    return res;
}
int main() {
    cin >> x >> k;
    if (x > 100 || k > 10) return 0;
    x = x * modpow(100, mod-2, mod) % mod;

    k *= 2;
    ll ans = 0;
    for (int mask = 0; mask < 1<<k; ++mask) {
        ll p = 1;
        int ma = 0;
        int now = 0;
        bool ok = true;
        for (int i = 0; i < k; ++i) {
            if (mask >> i & 1) {
                ++now;
                p = p * x % mod;
            } else {
                --now;
                p = p * ((1-x + mod) % mod) % mod;
            }
            if (now < 0) {
                ok = false;
                break;
            }
            ma = max(ma, now);
        }
        ok = (ok && (now == 0));
        if (ok) {
            ans += p * ma % mod;
            ans %= mod;
        }
    }
    cout << ans << '\n';
}