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.*;
import java.util.*;

public class Main {


    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int n = nextInt();
        int k = nextInt();
        long dp[][] = new long[n + 1][k];
        int y = (int) (1e9 + 7);
        for (int i = 0; i < k; i++)
            dp[1][i] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i][0] = 1;
            Stack<Integer> op = find(i);
            while (!op.isEmpty()) {
                int ii = op.pop();
                for (int j = 1; j < k; j++) {
                    dp[i][j] += dp[ii][j - 1];
                    dp[i][j] %= y;
                }
            }
            for (int j = 1; j < k; j++) {
                dp[i][j] += dp[i][j - 1];
                dp[i][j] %= y;
            }
            dp[i][k - 1] += dp[i - 1][k - 1];
            dp[i][k - 1] %= y;
        }
        System.out.println(dp[n][k - 1]);
        /*for (int i = 0; i <= n; i++) {
            for (int j = 0; j < k; j++) {
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }*/
    }


    static Stack<Integer> find(int x) {
        Stack<Integer> a = new Stack<>();
        int b = (int) Math.sqrt(x);
        for (int i = 2; i < b + 1; i++) {
            if (x % i == 0) {
                a.add(i);
                a.add(x / i);
            }
        }
        if (b * b == x)
            a.pop();
        a.add(1);
        return a;
    }


    static BufferedReader br;

    static StringTokenizer in = new StringTokenizer("");

    static String next() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
}