#include #include using namespace std; using namespace atcoder; using mint = modint998244353; int main(void) { int x, k; cin >> x >> k; mint sx = x; // evilケースを除去 if (k > 10) { return 0; } int k2 = k * 2; mint ans = 0; mint sq = 100; for (int bit = 0; bit < (1 << k2); bit++) { mint p = 1, mx = 100; int depth = 0, cur = 0; bool flag = true; // 表示 //string s; //for (int i = 0; i < k2; i++) { // if (bit & (1 << i)) s.push_back('('); // else s.push_back(')'); //} //cout << s << endl; for (int i = 0; i < k2; i++) { if (bit & (1 << i)) { p *= (sx / sq); cur++; } else { if (cur == 0) flag = false; p *= ((mx - sx) / sq); cur--; } //cout << " i = " << i << " p = " << p.val() << endl; depth = max(depth, cur); } mint sd = depth; //if (cur == 0 && flag) { // cout << s << " p = " << p.val() << " depth = " << depth << endl; //} if (cur == 0 && flag) { ans += (sd * p); } } cout << ans.val() << endl; return 0; }