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

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var mod = 998_244_353;
        var rev = Exp(n, mod - 2, mod);
        var dp = new long[n + 1];
        dp[0] = 1;
        var ans = n;
        for (var i = 0; i < k; ++i)
        {
            var ndp = new long[n + 1];
            for (var j = 0; j < dp.Length; ++j)
            {
                if (j > 0)
                {
                    ndp[j - 1] = (ndp[j - 1] + dp[j] * j % mod * rev) % mod;
                    ans = (ans + dp[j] * j % mod * rev) % mod;
                }
                if (j < n) ndp[j + 1] = (ndp[j + 1] + dp[j] * (n - j) % mod * rev) % mod;
            }
            dp = ndp;
        }
        WriteLine(ans);
    }
    static long Exp(long n, long k, int mod)
    {
        if (k == 0) return 1;
        if (k == 1) return n % mod;
        var half = Exp(n, k / 2, mod);
        var result = (half * half) % mod;
        return ((k % 2) == 0) ? result : ((result * n) % mod);
    }
}