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 int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).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 revs = new long[n + 1];
        for (var i = 1; i < revs.Length; ++i) revs[i] = Exp(i, mod - 2, mod);
        var dp = new long[k + 1][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = new long[n + 1];
        dp[0][n] = 1;
        for (var i = 0; i < k; ++i)
        {
            var sum = 0L;
            dp[i + 1][n] = 1;
            for (var j = n - 1; j >= 0; --j)
            {
                sum = (sum + dp[i][j + 1]) % mod;
                dp[i + 1][j] = sum * revs[n - j] % mod;
            }
        }
        WriteLine(dp[k][0]);
    }
    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);
    }
}