// 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);
}

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

  int x,k;cin>>x>>k;
  mint p=x,q=100-x;
  p/=100,q/=100;
  if(k>10){
    assert(0==1);
  }

  mint ans=0;

  rep(bit,0,(1<<(2*k))){
    int d=0,dmax=0;
    int flg=1;
    mint a=1;
    rep(i,0,2*k){
      if(bit&(1<<i)){
        a*=p;
        d++;
        dmax=max(dmax,d);
      }
      else{
        a*=q;
        d--;
        if(d<0){
          flg=0;
          break;
        }
      }
    }

    if(flg&&d==0){
      ans+=a*dmax;
    }
  }

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