MOD = 998244353

n, m = map(int, input().split())

dp = [0] * 31
eq = 0
for b in bin(m)[2:]:
    b = int(b)
    for i in range(30, 0, -1):
        dp[i] += dp[i - 1]
    if b:
        dp[eq] += 1
    eq += b
dp[eq] += 1

ans = 0
for i, d in enumerate(dp):
    ans += pow(n, i, MOD) * d % MOD
    ans %= MOD

print(ans)