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();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        if (k == 3)
        {
            if (n == 3) WriteLine("4 12");
            else if (n == 4) WriteLine("2 8");
            else WriteLine("0 0");
            return;
        }
        var mod = 998_244_353;
        var dp1 = new long[k * k];
        var dp2 = new long[k * k];
        var cum1 = new long[k * (k + 1)];
        var cum2 = new long[k * (k + 1)];
        for (var i = 0; i < dp1.Length; ++i)
        {
            var x = i / k;
            var y = i % k;
            if (x == y || (x == 0 && y == 1) || (x == k - 1 && y == k - 2)) continue;
            dp1[i] = 1;
            dp2[i] = x + y;
        }
        for (var i = k; i < cum1.Length; ++i)
        {
            cum1[i] = (dp1[i - k] + cum1[i - k]) % mod;
            cum2[i] = (dp2[i - k] + cum2[i - k]) % mod;
        }
        for (var i = 2; i < n; ++i)
        {
            var ndp1 = new long[k * k];
            var ndp2 = new long[k * k];
            for (var j = 0; j < dp1.Length; ++j)
            {
                var y = j / k;
                var z = j % k;
                if (y == z || (i + 1 < n && ((y == 0 && z == 1) || (y == k - 1 && z == k - 2)))) continue;
                if (y > z)
                {
                    ndp1[j] = (cum1[y * k + y] - dp1[z * k + y] + mod) % mod;
                    ndp2[j] = (cum2[y * k + y] - dp2[z * k + y] + mod + ndp1[j] * z % mod) % mod;
                }
                else
                {
                    ndp1[j] = (cum1[k * k + y] - cum1[y * k + y] + mod - dp1[z * k + y] + mod) % mod;
                    ndp2[j] = (cum2[k * k + y] - cum2[y * k + y] + mod - dp2[z * k + y] + mod + ndp1[j] * z % mod) % mod;
                }
            }
            var ncum1 = new long[k * (k + 1)];
            var ncum2 = new long[k * (k + 1)];
            for (var j = k; j < ncum1.Length; ++j)
            {
                ncum1[j] = (ndp1[j - k] + ncum1[j - k]) % mod;
                ncum2[j] = (ndp2[j - k] + ncum2[j - k]) % mod;
            }
            dp1 = ndp1;
            dp2 = ndp2;
            cum1 = ncum1;
            cum2 = ncum2;
        }
        WriteLine($"{dp1.Sum() % mod} {dp2.Sum() % mod}");
    }
}