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.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

/**
 * ToDo: describe
 *
 * @author keks
 */
public class A {
    private static final long DIV = 1000000007;

    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);
        final int n = sc.nextInt();
        final int k = sc.nextInt();
        final long[][] s = new long[k + 1][n + 1];
        Arrays.fill(s[1], 1);

        final List<?>[] divs = new ArrayList<?>[n + 1];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (j > i) {
                    break;
                }

                if (i % j != 0) {
                    continue;
                }

                if (divs[i] == null) {
                    divs[i] = new ArrayList<Long>();
                }

                ((List<Long>)divs[i]).add((long)j);
            }
        }

        for (int j = 2; j <= k; j++) {
            for (int i = 1; i <= n; i++) {
                for (Object o : divs[i]) {
                    final int l = ((Long) o).intValue();
                    if (l > i) {
                        break;
                    }

                    if (i % l != 0) {
                        continue;
                    }

                    s[j][i] += s[j - 1][i / l];
                    s[j][i] = s[j][i] % DIV;
                }
            }
        }

        long sum = 0;
        for (int i = 1; i <= n; i++) {
            sum += s[k][i];
            sum = sum % DIV;
        }
        System.out.println(sum);
    }
}