Problem Statement

Honda, who hates prime numbers, does not really want to use numbers composed of few primes (numbers with few distinct prime factors). So he has decided to use, among the numbers from $2〜N$, only those that have at least $K$ prime factors. However, since he would not like having too few usable numbers, he has decided to find out in advance how many numbers he can use.

Given $N$ and $K$, output the count of usable numbers.

Input

N K

The input is given as integers.
$2 \le N \le 2,000,000=2\times 10^6$
$1 \le K \le 100$

Output

Output the count of numbers between $2$ and $N$, inclusive, whose number of distinct prime factors is at least $K$.
Print a newline at the end.

Sample

2 1

1

4 2

0

1000 4

23