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


template<int MOD> struct Fp {  
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator > (const Fp& r) const noexcept {
		return this->val > r.val;
	}
	constexpr bool operator < (const Fp& r) const noexcept {
		return this->val < r.val;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<998244353>;

int main(){
	int x,K; cin >> x >> K;
	if(K > 10)return 0;
	mint p[2*K+1];
	mint p2[2*K+1];
	p[0] = 1;
	p2[0] = 1;
	for(int i = 1; i <= 2*K; i++)p[i] = p[i-1] * x;
	for(int i = 1; i <= 2*K; i++)p2[i] = p2[i-1] * (mint(100) - x);
	mint ans = 0;
	for(int i = 0; i < (1<<2*K); i++){
		if(__builtin_popcount(i) != K)continue;
		int now = 0;
		int d = 0;
		bool ok = 1;
		for(int j = 0; j < 2*K; j++){
			if(i >> j & 1)now++;
			else now--;
			d = max(d , now);
			if(now < 0)ok = 0;
		}
		if(ok)ans += p[K] * p2[K] * d;
	}
	ans /= modpow(mint(100) , 2*K);
	cout << ans << endl;
	return 0;
}