package main

import . "fmt"
import . "math/big"

func main() {
	var x, k int
	Scan(&x, &k)
	if k > 10 {
		return
	}
	modulo := NewInt(998244353)
	px := NewRat(int64(x), 100)
	mx := NewRat(int64(100-x), 100)
	prob := NewRat(0, 1)
	var dfs func(d, p, m int, r *Rat)
	dfs = func(d, p, m int, r *Rat) {
		if p < 0 {
			return
		}
		if d == 2*k {
			if p == 0 {
				prob = prob.Add(prob, new(Rat).Mul(r, NewRat(int64(m), 1)))
			}
			return
		}
		dfs(d+1, p+1, max(p+1, m), new(Rat).Mul(r, px))
		dfs(d+1, p-1, m, new(Rat).Mul(r, mx))
	}
	dfs(0, 0, 0, NewRat(1, 1))
	num := new(Int).Mod(prob.Num(), modulo)
	denom := new(Int).ModInverse(prob.Denom(), modulo)
	ans := new(Int).Mul(num, denom)
	Println(ans.Mod(ans, modulo))
}

func max(a, b int) int {
	if a > b {
		return a
	} else {
		return b
	}
}