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:
n, k = map(int, raw_input().split())

li = [0] * (n+2)

i = 2
while i<=n:
	if li[i]==0:
		j = i
		while j<=n:
			li[j] += i
			j += i
	i += 1

print li.count(k)