Problem: Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.

A sequence of l integers b1, b2, ..., bl (1 ≤ b1 ≤ b2 ≤ ... ≤ bl ≤ n) is called good if each number divides (without a remainder) by the next number in the sequence. More formally <image> for all i (1 ≤ i ≤ l - 1).

Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007 (109 + 7).

Input

The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).

Output

Output a single integer — the number of good sequences of length k modulo 1000000007 (109 + 7).

Examples

Input

3 2


Output

5


Input

6 4


Output

39


Input

2 1


Output

2

Note

In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].

Solution (in PYTHON):

Solution:
n,k = map(int,raw_input().split())
e = 1000000007
def solve(x):
	r = []
	for i in xrange(1,int(x**0.5)+1,1):
		if x%i==0:
			if i==x/i:
				r.append(i)
			else:
				r.extend([i,x/i])
	return r
r1 = []
for i in xrange(1,n+1,1):
	r1.append(solve(i))
#print r1
s = [[0]*n for _ in xrange(k)]
for i in xrange(k):
	for j in xrange(n):
		if i==0:
			s[i][j]=1
		else:
			if j==0:
				s[i][j]=1
			else:
				for w in r1[j]:
					s[i][j]=(s[i][j]+s[i-1][w-1])%e
print sum(s[k-1])%e