#include <bits/stdc++.h>

using ll = std::int64_t;

std::tuple<ll, ll, ll> extgcd(ll a, ll b){
    ll s1 = 1, t1 = 0, s2 = 0, t2 = 1;
    while(b != 0){
        std::tie(s1, t1, s2, t2) = std::make_tuple(s2, t2, s1 - (a / b) * s2, t1 - (a / b) * t2);
        std::tie(a, b) = std::make_tuple(b, a % b);
    }
    return std::make_tuple(s1, t1, a);
}

ll inv(ll a, ll n){
    ll inv_a;
    std::tie(inv_a, std::ignore, std::ignore) = extgcd(a, n);
    inv_a %= n;
    if(inv_a < 0){inv_a += n;}
    return inv_a;
}

ll pow(ll a, ll n, ll m){
    ll p = 1;
    while(n > 0){
        if(n & 1){
            p = p * a % m;
        }
        a = a * a % m;
        n /= 2;
    }
    return p;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    ll x;
    int K;
    std::cin >> x >> K;

    constexpr ll MOD = 998'244'353;
    ll p = x * inv(100, MOD) % MOD, q = (100ll - x) * inv(100, MOD) % MOD;
    ll res = 0;
    for(int i=0;i<(1<<(2*K));i++){
        ll n = __builtin_popcountll(i);
        ll r = pow(p, n, MOD) * pow(q, (2 * K) - n, MOD) % MOD;
        int d = 0, max_d = 0;
        for(int j=0;j<2*K;j++){
            if(i >> j & 1){
                d += 1;
                max_d = std::max(max_d, d);
            }else{
                if(d == 0){
                    max_d = 0;
                    break;
                }
                d -= 1;
            }
        }
        if(d > 0){max_d = 0;}
        r = r * max_d % MOD;
        res += r;
        if(res >= MOD){res -= MOD;}
    }

    std::cout << res << std::endl;
}