"""

Tea Time 想定解
定数倍無視ver

注: ミスっています WAです。

"""

import sys
from sys import stdin

mod = 998244353

def modfac(n, MOD):
 
    f = 1
    factorials = [1]
    for m in range(1, n + 1):
        f *= m
        f %= MOD
        factorials.append(f)
    inv = pow(f, MOD - 2, MOD)
    invs = [1] * (n + 1)
    invs[n] = inv
    for m in range(n, 1, -1):
        inv *= m
        inv %= MOD
        invs[m - 1] = inv
    return factorials, invs

def modnCr(n,r):
    if n < 0 or r < 0 or n < r:
        return 0
    return fac[n] * inv[n-r] * inv[r] % mod

fac,inv = modfac(1000,mod)


N,K = map(int,stdin.readline().split())

# 制約チェック
assert 1 <= N <= 400
assert 0 <= K <= 400

# 1つ目の括弧は置いた状態から開始
dp = [ [ [0,0]  ] , [ [0,0] ] ]
dp[1][0][0] = 1

for i in range(2,2*K+1):

    ndp = [[[0,0] for pnum in range(i)] for nnum in range(min(K+1,i+1))]

    for ls in range(len(dp)):
        for lp in range(len(dp[0])):
            for last in range(2):

                for put in range(2): #置く括弧 0 = ( , 1 = )

                    news = ls + (1,-1)[put]
                    newp = lp + (1 if last != put else 0)

                    if 0 <= news < len(ndp):
                        ndp[news][newp][put] += dp[ls][lp][last]
                        ndp[news][newp][put] %= mod
    
    dp = ndp

ans = 0

for p in range(len(dp[0])):

    now = dp[0][p][1] * modnCr(2*K+N-p,N-p)
    #print (p,dp[0][p][1] , modnCr(2*K+N-p,N-p))
    ans += now
    ans %= mod

print (ans)