You are given the integers $n$ and $k$. You want to calculate how many different integers $x$ $(1\le x \le n)$ can be obtained as a product of $x_i$ such that:
As an example, assume that $n = 20$ and $k=8$, then:
So 1, 12, 16, 8 and others can be obtained.
First line contains integers $n$ and $k$ $(1\le n,k \le 1000)$.
On a single line print the answer to the problem.