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.InputStream;
import java.io.InputStreamReader;

public class D {

    static int mod=(int)1e9+7;
    
    static void run_stream(InputStream ins) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String[] nk=br.readLine().split(" ");
        int N=Integer.parseInt(nk[0]);
        int K=Integer.parseInt(nk[1]);
        
        long[][] f=new long[K+1][N+1];
        for (int i=1; i<=N; i++) {
            f[1][i]=1;
        }
        
        for (int size=2; size<=K; size++) {
            for (int i=N; i>0; i--) {
                for (int factor=2, j=i*factor; j<=N; factor++, j=i*factor) {
                    f[size-1][j]+=f[size-1][i];
                    f[size-1][j]%=mod;
                }
            }
            for (int max=1; max<=N; max++) {
                /*for (int k=1; k<=max; k++) {
                    f[size][max]+=(f[size-1][k]*(max%k==0? 1: 0))%mod;
                    f[size][max]%=mod;
                }*/
                
                f[size][max]+=f[size-1][max];
                f[size][max]%=mod;
            }
            
        }
        
        long ret=0;
        for (int i=0; i<=N; i++) {
            ret+=f[K][i];
            ret%=mod;
        }
        System.out.println(ret);
    }

    public static void main(String[] args) throws IOException {
        run_stream(System.in);
    }

}