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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;

public class B414 {
    static int modulo = 1000000007;
    public static void main (String[] args) throws IOException {
        BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
        String[] s1 = inp.readLine().split(" ");
        int givenNumbers = Integer.parseInt(s1[0]);
        int reqd = Integer.parseInt(s1[1]);
        int[][] dp = new int[reqd+1][givenNumbers+1];
        int ans = solve(dp,reqd,givenNumbers);
        System.out.println(ans);

    }
    static int solve(int[][] dp,int reqd,int givenNumbers){

        if(reqd!=1) {
            ArrayList<Integer> list[] = new ArrayList[givenNumbers + 1];
            for (int i = 1; i <= givenNumbers; i++) {
                list[i] = factor(i);
            }
            for (int i = 1; i <= givenNumbers; i++) {
                dp[2][i] = list[i].size();
            }
            for (int j = 3; j <= reqd; j++) {
                for (int i = 1; i <= givenNumbers; i++) {
                    int sum = 0;
                    Iterator<Integer> iterator = list[i].listIterator();
                    while (iterator.hasNext()) {
                        int n = iterator.next();
                        sum = (sum + dp[j - 1][n])%modulo;
                    }
                    dp[j][i] = sum %modulo;
                }
            }

            int ans = 0;
            for (int i = 1; i <= givenNumbers; i++) {
                ans = (ans + dp[reqd][i])%modulo;
            }
            //printDp(dp, givenNumbers, reqd);
            return ans;
        }
        else{
            return givenNumbers;
        }
    }
    static ArrayList<Integer> factor(int a){
        int b = (int) Math.sqrt(a);
        ArrayList<Integer> count = new ArrayList<>();
        for(int i=b;i>0;i--){
            if(a%i==0){
                count.add(i);
                int z = a/i;
                if(z!=1 && z!=i) {
                    count.add(z);
                }
            }
        }
        return count;
    }
    static void printDp(int[][] dp,int givenNumbers,int reqd){
        for(int i=0;i<=reqd;i++){
            for(int j=0;j<=givenNumbers;j++){
                System.out.print(dp[i][j]);
            }
            System.out.println();
        }
    }
}