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:
from sys import stdin,stdout,setrecursionlimit,maxint,exit
setrecursionlimit(2*10**5)
def listInput():
 return map(long,stdin.readline().split())
def printBS(li):
 if len(li)==0: return 
 for i in xrange(len(li)-1):
  stdout.write("%d "%li[i])
 stdout.write("%d\n"%li[-1])
def sin():
 return stdin.readline().rstrip()
n,k=listInput()
MOD=10**9+7
adjList=[[] for i in xrange(n+1)]
for i in xrange(1,n+1):
 for j in xrange(i,n+1,i):
  adjList[i].append(j)
ans=[[0]*(k+1) for i in xrange(n+1)]
for i in xrange(1,n+1):
 ans[i][1]=1
for i in xrange(1,k+1):
 ans[n][i]=1
for i in xrange(n-1,0,-1):
 for j in xrange(2,k+1):
  for l in adjList[i]:
   ans[i][j]=(ans[i][j]+ans[l][j-1])%MOD
pr=0
for i in xrange(1,n+1):
 pr=(pr+ans[i][k])%MOD
print pr