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

public class Main {

    static int n,k;
    static int[][] dp;
    static final int INF = 1000000007;

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        PrintWriter out = new PrintWriter(System.out);

        n = scan.nextInt();
        k = scan.nextInt();
        dp = new int[n+1][k+1];

//      ArrayList<ArrayList<Integer>> divisor = new ArrayList<ArrayList<Integer>>();
//      divisor.add(0,new ArrayList<Integer>());

        short[][] divisor = new short[n+1][];

        for (int i = 1; i <= n ; i++) {
//          ArrayList<Integer> list = new ArrayList<Integer>();
            short[] list = new short[n];
            int cnt = 0;
            for (short j = 1; j <= i ; j++) {
//              if(i%j==0) list.add(j);
                if(i%j==0){
                    list[cnt] = j;
                    cnt++;
                }
            }
//          divisor.add(i, list);
            divisor[i] = list;
        }

        for (int i = 1; i <= n ; i++) {
            dp[i][1] = 1;
        }


        for (int j = 2; j <= k ; j++) {
            for (int i = 1; i <= n ; i++) {
                int sum = 0;
//              ArrayList<Integer> list = divisor.get(i);
                short[] list = divisor[i];
                for (int q = 0; q < n; q++) {
                    if(list[q]==0) break;
                    sum = (sum + dp[list[q]][j-1])% INF;
                }
//              for (Integer p : list) {
//                  sum = (sum + dp[p][j-1]) % INF;
//              }
                dp[i][j] = sum;
            }
        }

        int ans = 0;
        for (int i = 1; i <= n ; i++) {
            ans = (ans + dp[i][k]) % INF;
        }

        out.println(ans);
        out.flush();
    }
}