// g++-13 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

using mint = modint998244353;

random_device seed;
mt19937_64 randint(seed());

ll grr(ll mi, ll ma) { // [mi, ma)
    return mi + randint() % (ma - mi);
}

const int MAX=510000;
const long long MOD=998244353;

long long fac[MAX],finv[MAX],inv[MAX];

void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

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

  COMinit();

  int n,x;cin>>n>>x;
  vector<mint> dp(n,0),coef(n,0);
  mint p=100-x,q=x;
  p/=100,q/=100;
  vector<mint> powp(n+10,0);

  dp[n-1]=1;
  coef[0]=1;
  powp[0]=1;
  rep(i,1,n){
    coef[i]=coef[i-1]*q;
  }
  rep(i,0,n){
    coef[i]/=fac[i];
    powp[i+1]=powp[i]*p;
  }

  mint ans=0;
  rep(i,1,n+1){
    // rep(j,0,n){
    //   cout<<dp[j].val()<<" ";
    // }
    // cout<<endl;
    rep(j,0,n+1-i){
      ans+=dp[j];
      // dp[j]*=fac[j];
    }
    rep(j,n+1-i,n){
      dp[j]=0;
    }
    rep(j,0,n){
      dp[j]*=fac[j];
    }
    reverse(all(dp));
    vector<mint> ndp=convolution(dp,coef);
    while(ndp.size()>n){
      ndp.pop_back();
    }
    reverse(all(ndp));
    rep(j,0,n){
      ndp[j]*=powp[j];
      ndp[j]/=fac[j];
    }

    dp=ndp;
  }

  cout<<ans.val()<<endl;
}