import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
mod = 998244353
nn = 400
fact = [1] * nn
for i in range(nn - 1):
    fact[i + 1] = fact[i] * (i + 1) % mod
invfact = [1] * nn
invfact[nn - 1] = pow(fact[nn - 1], mod - 2, mod)
for i in range(nn - 1)[::-1]:
    invfact[i] = invfact[i + 1] * (i + 1) % mod
 
def binom(x, y):
    if x < 0 or y < 0 or x - y < 0:
        return 0
    return fact[x] * invfact[y] % mod * invfact[x - y] % mod

n,m = na()
m = n*(n-1)//2 - m
if m > n:
    print(0)
    exit()
mod = 998244353

cycle = [0]*nn
for i in range(3,nn):
    cycle[i] = fact[i-1]*pow(2,mod-2,mod)%mod
cycle[2] = 1
path = [0]*nn
for i in range(2,nn):
    path[i] = fact[i]*pow(2,mod-2,mod)%mod
path[1] = 1
dp = [[0 for j in range(m+1)]for i in range(n+1)]

dp[0][0] = 1
for j in range(m+1):
    for i in range(n+1):
        for k in range(5,n+1):
            ni = i + k
            nj = j + k
            if ni > n or nj > m:
                break
            #print(binom(n-i-1, k-1),cycle[k])
            """if ni == 5 and nj == 4:
                print(i, j, k, dp[i][j] * binom(n-i-1, k-1) % mod * cycle[k] % mod)"""
            dp[ni][nj] += dp[i][j] * binom(n-i-1, k-1) % mod * cycle[k] % mod
            dp[ni][nj] %= mod
        for k in range(1,n+1):
            ni = i + k
            nj = j + k - 1
            if ni > n or nj > m:
                break
            #print(binom(n-i-1, k-1),path[k])
            dp[ni][nj] += dp[i][j] * binom(n-i-1, k-1) % mod * path[k] % mod
            dp[ni][nj] %= mod
        #print(dp)
ans = dp[-1][-1]

print(ans)