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

using mint = modint998244353;

mint c[5005], s[5005][5005], p, fact[5005];
bool c_used[5005], s_used[5005][5005];

mint C(int n);
mint S(int n, int k);

mint C(int n) {
    if (c_used[n]) return c[n];
    c_used[n] = true;
    mint res = 1;
    for (int i = 1; i <= n-1; i++) res -= S(n, i);
    return c[n] = res;
}

mint S(int n, int k) {
    if (s_used[n][k]) return s[n][k];
    s_used[n][k] = true;
    mint res = fact[n-1] / fact[k-1] / fact[n-k] * C(k) * (1-p).pow(k*(n-k));
    return s[n][k] = res;
}

int main() {
    int N, x;
    cin >> N >> x;

    p = (mint)x / 100;
    fact[0] = 1;
    for (int i = 1; i <= N; i++) fact[i] = fact[i-1] * i;

    mint ans = 0;
    for (int k = 1; k <= N; k++) ans += k * S(N, k);
    cout << ans.val() << endl;
}