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.
n,k=map(int,raw_input().split())
s=[0]*(n+1)
for i in range(2,n+1):
    if(s[i]==0):
        for j in xrange(i,n+1,i):
            s[j]=s[j]+i
count=0
for i in range(n+1):
    if(s[i]==k):
        count+=1;
print count