import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def main():
    mod = 10**9+7
    mod2 = 998244353
    n, k = map(int, input().split())
    assert 3 <= n <= 200 and 3 <= k <= 200
    dp = [[int(i != j) for j in range(k)] for i in range(k)]
    # dp[i][j]末尾がiで、末尾1つ前がjであるような、門松列列の通り数
    dp2 = [[int(i != j)*(i+j) for j in range(k)] for i in range(k)]
    # dp2[i][j]末尾がiで、末尾1つ前がjであるような、門松列列の数列の和を足し合わせたもの
    for _ in range(3, n+1):
        dpacc = list(map(lambda x: list(accumulate(x)), dp))
        dp2acc = list(map(lambda x: list(accumulate(x)), dp2))
        newdp = [[0]*k for i in range(k)]
        newdp2 = [[0]*k for i in range(k)]
        for b in range(k):
            for c in range(k):
                if b > c:
                    newdp[c][b] = (dpacc[b][b-1]-dp[b][c]) % mod2
                    newdp2[c][b] = (dp2acc[b][b-1]-dp2[b][c] + newdp[c][b]*c) % mod2
                if b < c:
                    newdp[c][b] = (dpacc[b][-1]-dpacc[b][b]-dp[b][c]) % mod2
                    newdp2[c][b] = (dp2acc[b][-1]-dp2acc[b][b]-dp2[b][c] + newdp[c][b]*c) % mod2
        dp=newdp
        dp2=newdp2
    print(sum(sum(d) for d in dp)%mod2,sum(sum(d) for d in dp2)%mod2)


if __name__ == '__main__':
    main()