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.StringTokenizer;

public class Main {

    private static long[][] dp;
    private static ArrayList<Integer>[] divisor;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());

        dp = new long[n+1][k+1];
        divisor = new ArrayList[n+1];
        for(int i=1; i<divisor.length; i++) {
            divisor[i] = getDivisor(i);
            dp[i][0] = 1;
            dp[i][1] = divisor[i].size();
        }

        for(int i=1; i<=n; i++) {
            for(int j=2; j<=k; j++) {
                getGoodSeq(i, j);
            }
        }

//        for(int i=1; i<divisor.length; i++) {
//            System.out.print(i+"("+divisor[i].size()+") : ");
//            for(int j=0; j<divisor[i].size(); j++) {
//                System.out.print(divisor[i].get(j)+" ");
//            }
//            System.out.println();
//        }
//
//        for(int i=1; i<dp.length; i++) {
//            System.out.print(i+ ": ");
//            for(int j=1; j<dp[i].length; j++) {
//                System.out.print(dp[i][j]+" ");
//            }
//            System.out.println();
//        }
        long result = 0;
        for(int i=1; i<=n; i++){
            result += dp[i][k-1];
        }
        System.out.println(result % 1000000007);
    }

    private static ArrayList<Integer> getDivisor(int num) {
        ArrayList<Integer> list = new ArrayList<>();
        for (int i=1; i <= num; i++) {
            if (num%i == 0) {
                list.add(i);
            }
        }
        return list;
    }

    private static void getGoodSeq(int num, int depth) {
        for(int i=0; i<divisor[num].size(); i++) {
            dp[num][depth] += dp[divisor[num].get(i)][depth-1] % 1000000007;
        }
    }
}