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.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        // Scanner scan = new Scanner(System.in);
        // PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); 
        // int n = Integer.parseInt(bf.readLine());
        StringTokenizer st = new StringTokenizer(bf.readLine());
        // int[] a = new int[n]; for(int i=0; i<n; i++) a[i] = Integer.parseInt(st.nextToken());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        ArrayList<ArrayList<Integer>> factors = new ArrayList<ArrayList<Integer>>();
        for(int i=0; i<n+1; i++) factors.add(new ArrayList<Integer>());
        for(int i=0; i<n+1; i++) 
            for(int j=1; j<n+1; j++) 
                if(i*j < factors.size()) factors.get(i*j).add(i); 
                else break;
        long[][] dp = new long[n+1][k+1];
        for(int i=0; i<n+1; i++) dp[i][1] = i;
        for(int i=0; i<k+1; i++) dp[1][i] = 1;
        for(int i=2; i<n+1; i++) {
            for(int j=2; j<k+1; j++) {
                dp[i][j] = dp[i-1][j];
                for(int f : factors.get(i))
                    dp[i][j] += (dp[f][j-1] - dp[f-1][j-1] + 2*1000000007) % 1000000007;
                dp[i][j] %= 1000000007;
            }
        }
            System.out.println(dp[n][k]);
        // int n = scan.nextInt();
        
        // out.close(); System.exit(0);
    }
}