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.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class MashmokhACM {
    public static final int MOD = 1000000007;
    public static final int MAX = 2001;

    public static void main(String[] args) {
        // 1<= n, k <= 2000
        // i,j -> number of good seq with i elements, with max j element


        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        long start = System.currentTimeMillis();
        int d[][] = new int[k + 1][n + 1];

        for (int i = 0; i <= n; i++) {
            d[1][i] = 1;
        }
        for (int j = 0; j <= k; j++) {
            d[j][1] = 1;
        }

        Map<Integer, List<Integer>> devisors = new HashMap<Integer, List<Integer>>();
        for (int i1 = 1; i1 <= n; i1++) {
            List<Integer> numbers = new ArrayList<Integer>();
            devisors.put(i1, numbers);
            for (int i2 = 1; i2 <= i1; i2++) {
                if (i1 % i2 == 0) {
                    numbers.add(i2);
                }
            }
        }

        for (int i = 2; i <= k; i++) {
            for (int j = 2; j <= n; j++) {
                for (int s : devisors.get(j)) {
                    d[i][j] = (d[i][j] + d[i - 1][s]) % MOD;

                }
            }
        }
        int res = 0;
        for (int i = 1; i <= n; i++) {
            res = (res + d[k][i]) % MOD;
        }
        System.out.println(res);
//        System.out.println("time:" + (System.currentTimeMillis() - start));
    }
}