#using ChatGPT o1-preview

mod = 998244353

def compute_mobius(N):
    mu = [1] * (N + 1)
    is_prime = [True] * (N + 1)
    for i in range(2, N + 1):
        if is_prime[i]:
            for j in range(i, N + 1, i):
                is_prime[j] = False
                mu[j] *= -1
            i_squared = i * i
            for j in range(i_squared, N + 1, i_squared):
                mu[j] = 0
    return mu

def compute_divisors(N):
    divisors = [[] for _ in range(N + 1)]
    for i in range(1, N + 1):
        for j in range(i, N + 1, i):
            divisors[j].append(i)
    return divisors

def main():
    def solve():
        K_str, N_str = input().split()
        K = int(K_str)
        N = int(N_str)
        mu = compute_mobius(N)
        divisors = compute_divisors(N)
        pow2 = [1] * (N + 1)
        for i in range(1, N + 1):
            pow2[i] = (pow2[i - 1] * 2) % mod
        P = [0] * (N + 1)
        if N == 1:
            P[1] = 2 if K == 1 else 3
        else:
            for n in range(2, N + 1):
                total = 0
                for d in divisors[n]:
                    if mu[n // d] == 0:
                        continue
                    total = (total + mu[n // d] * pow2[d]) % mod
                P[n] = total % mod
        print(P[N] % mod)
    solve()
main()