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:
def nCk(n,k):
    v=1
    for i in range(n-k+1,n+1):
        v*=i
    for i in range (1,k+1):
        v/=i
    return v

def prime_factor(n):
    pf = []
    f=2
    while f**2<=n:
        cnt=0
        while n%f==0:
            n/=f 
            cnt+=1
        if cnt>0:    
            pf.append((f,cnt))
        f+=1
    if n>1:
        pf.append((n,1))
    return pf

l=lambda:map(int,raw_input().split())
n,k=l()
ans=0
for i in range(1,n+1):
    t=1
    for f,cnt in prime_factor(i):
        t*=nCk(cnt+k-1,cnt)
        t%=1000000007
    ans+=t
    ans%=1000000007
print ans

'''
#overtime version 
l=lambda:map(int,raw_input().split())
n,k=l()
modn=1000000007
N=2000+10
dp=[[0 for i in range(N)] for j in range(N)]
dp[1]=[0]+[1]*(N-1)
for i in range(2,k+1):
    for j in range(1,n+1):
        x=1
        while x*x<=j:
            if j%x==0:        
                dp[i][j]+=dp[i-1][x]
                if x<>j/x:
                    dp[i][j]+=dp[i-1][j/x]
                dp[i][j]%=modn
            x+=1              
print sum(dp[k][1:n+1])%modn                 
'''
'''
6 4
39
1: 1111
2: 1112,1122,1222,2222
3: 1113,1133,1333,3333
4: 1114,1124,1144,1224,1244,1444,2224,2244,2444,4444
5: 1115,1155,1555,5555
6: 1116,1126,1136,1166,1226,1266,1336,1366,1666,2226,2266,2666,3336,3366,3666,6666
'''