mod = 998244353


def main():
    import sys
    input = sys.stdin.readline

    # comb init
    nmax = 30 + 10  # change here
    fac = [0] * nmax
    finv = [0] * nmax
    inv = [0] * nmax
    fac[0] = 1
    fac[1] = 1
    finv[0] = 1
    finv[1] = 1
    inv[1] = 1
    for i in range(2, nmax):
        fac[i] = fac[i - 1] * i % mod
        inv[i] = mod - inv[mod % i] * (mod // i) % mod
        finv[i] = finv[i - 1] * inv[i] % mod

    def comb(n, r):
        if n < r:
            return 0
        else:
            return (fac[n] * ((finv[r] * finv[n - r]) % mod)) % mod

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

    popcnt = [0] * 31
    cnt1 = 0
    for i in range(M.bit_length() - 1, -1, -1):
        if M >> i & 1:
            K = i
            for k in range(K + 1):
                popcnt[k + cnt1] = (popcnt[k + cnt1] + comb(K, k)) % mod
            cnt1 += 1
    popcnt[cnt1] += 1
    ans = 0
    for i in range(31):
        tmp = pow(N, i, mod)
        ans = (ans + tmp * popcnt[i])%mod
    print(ans)


if __name__ == '__main__':
    main()