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

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 *
 */
public class D {
    static int[] getMult(int n) {
        int[] res = new int[n/2 + 1];
        int resi = 0;
        for (int i = 1; i <= n/2; i++) {
            if(n%i==0) {
                res[resi] = i;
                resi++;
            }
        }
        res[resi] = n;
        int[]res2 = new int[resi+1];
        System.arraycopy(res, 0, res2, 0, resi+1);
        return res2;
    }
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());




        int[][] d = new int[n][];
        for (int i = 0; i < n; i++) {
            d[i] = getMult(i+1);
           // System.out.println((i+1) + "->"+Arrays.toString(d[i]));
        }

        long[][] a = new long[n+1][k];
        for (int i = 0; i < n; i++) {
            a[i+1][0] = 1;
        }
        for (int i = 1; i < k; i++) {

            for (int j = 1; j <= n; j++) {
                for (int m = 0; m < d[j - 1].length; m++) {
                    a[j][i] = (a[j][i] + a[j/d[j-1][m]][i-1]) % 1000000007;
                }
            }
        }
        long res = 0;
        for (int i = 0; i < n; i++) {
            res = (res + a[i+1][k-1])%1000000007;
        }
        System.out.println(res);
    }
}