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 First {
    private static final Scanner sc = new Scanner(System.in);
    private static final PrintWriter pw = new PrintWriter(System.out);
    private static StringBuffer ans = new StringBuffer();
    private static final long mod = 1000000007L;

    public static void main(String[] args) throws Exception {
        int n = sc.nextInt(), k = sc.nextInt();
        long[][] a = new long[k][n];
        long sum = 0L;
        for (int i = 0; i < n; i++) a[0][i] = 1L;
        for (int i = 0; i < k - 1; i++) {
            for (int j = 0; j < n; j++) {
                for (int l = j; l < n; l += (j + 1)) {
                    a[i + 1][l] = (a[i][j] + a[i + 1][l]) % mod;
                }
            }
        }
        for (int i = 0; i < n; i++) sum = (sum + a[k - 1][i]) % mod;
        ans.append(sum);
        pw.print(ans);
        sc.close();
        pw.close();
    }
}
class Scanner {
    private final BufferedReader br;
    private StringTokenizer st;
    public Scanner(InputStream in) {
        br = new BufferedReader(new InputStreamReader(in));
        st = new StringTokenizer("");
    }
    public String next() throws IOException {
        if (!st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    public void close() throws IOException {
        br.close();
    }
}
class PrintWriter {
    private final BufferedOutputStream pw;
    public PrintWriter(OutputStream out) {
        pw = new BufferedOutputStream(out);
    }
    public void print(Object o) throws IOException {
        pw.write(o.toString().trim().getBytes());
        pw.flush();
    }
    public void close() throws IOException {
        pw.close();
    }
}