Problem: Rasta calls a number like a Tavas if and only if 1 ≤ a ≤ n and the sum of all primes (like p) that p | a is exactly equal to k.

He asks you to find the number of Tavases.

Input format
The first and only line of input contains two integers, n and k (1 ≤ n, k ≤ 10^6).

Output format
Print a single integer, the number of Tavases.

SAMPLE INPUT
20 7

SAMPLE OUTPUT
3

Explanation

The only Tavases are 7, 10 and 20.

Solution (in PYTHON):

Solution:
def seive():
    p = [0] * 1000001
    for i in range(2, 1000001):
        if not p[i]:
            j = i
            while j < 1000001:
                p[j] += i
                j += i
           
    return p

prim = seive()
n, k = map(int, raw_input().split())
cnt = 0
for i in range(1, n+1):
    if prim[i] == k:
        cnt += 1
print cnt