MOD = 998244353
N, M = map(int, input().split())
b = bin(M)[2:]
L = len(b)
dp = [[[0, 0] for j in range(L + 1)] for i in range(L + 1)]
dp[0][0][0] = 1

for i in range(L):
    for j in range(L + 1):
        if b[i] == '0':
            # 0
            dp[i + 1][j][0] = (dp[i + 1][j][0] + dp[i][j][0]) % MOD
            dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j][1]) % MOD
            # 1
            if j > 0:
                dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j - 1][1]) % MOD
        else:
            # 0
            dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j][0]) % MOD
            dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j][1]) % MOD
            # 1
            if j > 0:
                dp[i + 1][j][0] = (dp[i + 1][j][0] + dp[i][j - 1][0]) % MOD
                dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j - 1][1]) % MOD

ans = 1
p = 1
for j in range(1, L + 1):
    p = (p * N) % MOD
    ans = (ans + p * sum(dp[-1][j])) % MOD

print(ans)