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

/**
 * Created by slycer on 1/10/16.
 */
public class MashmokhandACM {

    public static long MOD = 1000000000l + 7;

    public static void main ( String [] args ) throws IOException {
       FastReader reader = new FastReader();
        reader.nextLineAsInt();
        int n = reader.nextInt();
        int k = reader.nextInt();
        long [][] dp = new long[k+1][n+1];
        Arrays.fill( dp[1], 1 );

        for ( int j=2; j<=k; j++ ){

            for ( int i=1; i<=n; i++ ){
                for ( int t=i; t<=n; t+=i ){
                    dp[j][t] += dp[j-1][i];
                    dp[j][t] = dp[j][t] % MOD;
                }
            }
        }

        long answer = 0;
        for ( int i=1; i<=n; i++ ){
            answer += dp[k][i];
            answer = answer % MOD; 
        }

        System.out.println( answer );
    }

    public static class FastReader {
        private BufferedReader reader;
        private int [] lastLineAsInt;
        private int pos;

        public FastReader (){
            reader = new BufferedReader( new InputStreamReader( System.in ) );
        }
        public long [] nextLineAsLong() throws IOException {
            String [] aux = reader.readLine().split( " " );
            long [] ret = new long[ aux.length ];
            for ( int i=0; i<aux.length; i++ ){
                ret[i] = Integer.valueOf( aux[i] );
            }
            return ret;
        }

        public int [] nextLineAsInt() throws IOException {
            String [] aux = reader.readLine().split( " " );
            int [] ret = new int[ aux.length ];
            for ( int i=0; i<aux.length; i++ ){
                ret[i] = Integer.valueOf( aux[i] );
            }
            pos = 0;
            lastLineAsInt = ret;
            return ret;
        }

        public int nextInt(){
            return lastLineAsInt[pos++];
        }

        public String nextLine() throws IOException {
            return reader.readLine();
        }
    }
    

}