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 = np.array([[int(i != j) for j in range(k)] for i in range(k)], dtype=np.int64) # dp[i][j]末尾がiで、末尾1つ前がjであるような、門松列列の通り数 dp2 = np.array([[int(i != j)*(i+j) for j in range(k)] for i in range(k)], dtype=np.int64) # dp2[i][j]末尾がiで、末尾1つ前がjであるような、門松列列の数列の和を足し合わせたもの for _ in range(3, n+1): dpacc = np.cumsum(dp, axis=1) dp2acc = np.cumsum(dp2, axis=1) newdp = np.zeros((k, k), dtype=np.int64) newdp2 = np.zeros((k, k), dtype=np.int64) for b in range(k): newdp[:b, b] += dpacc[b][b-1] newdp[b+1:, b] += dpacc[b][-1]-dpacc[b][b] newdp2[:b, b] += dp2acc[b][b-1] newdp2[b+1:, b] += dp2acc[b][-1]-dp2acc[b][b] newdp -= dp.T newdp2-=dp2.T for c in range(k): newdp2[c] += newdp[c]*c dp = newdp % mod2 dp2 = newdp2 % mod2 print(dp.sum().sum() % mod2, dp2.sum().sum() % mod2) if __name__ == '__main__': main()