mod = 998244353
D = 33


N, M = map(int, input().split())

dp = [[[0] * (D + 1) for _ in range(2)] for _ in range(D + 1)]
dp[D][0][0] = 1

for i in reversed(range(D)):
    nd = (M >> i) & 1
    for j in range(2):
        for k in range(D):
            for d in range(2):
                nj = j
                if nj == 0:
                    if d > nd:
                        continue
                    if d < nd:
                        nj = 1

                dp[i][nj][k+d] += dp[i+1][j][k]


ans = 0
for i in range(D):
    ans += pow(N, i, mod) * (dp[0][0][i] + dp[0][1][i]) % mod
    ans %= mod
print(ans)