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 PYTHON3):

Solution:
import random
import math
from collections import defaultdict
import itertools
from sys import stdin, stdout
import sys
import operator

#sys.setrecursionlimit(1500000000)



def main():
    #z = ''
    #p = lambda *a: print(*a, flush = True)
    #d = defaultdict()

    mod = 10**9+7

    # t = int(input())
    # for _ in range(t):
    #     n = int(input())
    n, k = list(map(int, input().split()))
        #n,a,b = list(map(int, input().split()))
        #s = input()

    dp = [[0 for _ in range(k-1)] for _ in range(n)]
    #print(dp)

    ans = 0
    if k ==1:
        print(n)
    else:
        for j in range(n):
                dp[j][k-2] = n//(j+1)
        for i in range(k-3, -1, -1):
            for j in range(n):
                m = 1
                while (j+1)*m<=n:
                    dp[j][i] = (dp[j][i]+ dp[(j+1)*m-1][i+1])%mod
                    m+=1

        ans = 0
        for i in range(n):
            ans = (ans+dp[i][0])%mod

        print(ans)


    #    s = input()

    #     z += str(ans) + '\n'
    # stdout.write(z)

#for interactive problems
#print("? {} {}".format(l,m), flush=True)
#or print this after each print statement
#sys.stdout.flush()


if __name__ == "__main__":
    main()