using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (x, k) = (c[0], c[1]);
        if (k > 10)
        {
            WriteLine(-1);
            return;
        }
        var mod = 998_244_353;
        var rev = Exp(100, mod - 2, mod);
        var f = x * rev % mod;
        var b = (100 - x) * rev % mod;
        var dp = new long[2 * k + 1][][];
        for (var i = 0; i < dp.Length; ++i)
        {
            dp[i] = new long[k + 1][];
            for (var j = 0; j < dp[i].Length; ++j) dp[i][j] = new long[k + 1];
        }
        dp[0][0][0] = 1;
        for (var i = 0; i + 1 < dp.Length; ++i)
        {
            for (var p = 0; p <= k; ++p) for (var q = 0; q <= p; ++q)
            {
                if (q < k)
                {
                    if (p == q) dp[i + 1][p + 1][q + 1] = (dp[i + 1][p + 1][q + 1] + dp[i][p][q] * f) % mod;
                    else dp[i + 1][p][q + 1] = (dp[i + 1][p][q + 1] + dp[i][p][q] * f) % mod;
                }
                if (q > 0)
                {
                    dp[i + 1][p][q - 1] = (dp[i + 1][p][q - 1] + dp[i][p][q] * b) % mod;
                }
            }
        }
        var ans = 0L;
        for (var p = 1; p <= k; ++p) ans = (ans + dp[^1][p][0] * p) % mod;
        WriteLine(ans);
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}