from math import ceil


def calc_prime_numbers(upper: int) -> list[int]:
    prime_numbers = []
    for number in range(2, upper+1):
        for prime in prime_numbers:
            if number % prime == 0:
                break
        else:
            prime_numbers.append(number)
    return prime_numbers


def main():
    N, L = map(int, input().split())
    interval_upper = ceil(L/(N-1))
    interval_candidate = calc_prime_numbers(interval_upper)

    patterns = 0
    for interval in interval_candidate:
        patterns += L - interval * (N - 1) + 1

    print(patterns)


if __name__ == "__main__":
    main()