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.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class B {
	public static void main(String[] args) throws Exception{
		int MOD = 1000000007;
		int n = readInt();
		int k = readInt();
		int[][] dp = new int[k+1][n+1];
		for(int i = 1; i <= n; i++){
			dp[1][i] = 1;
		}
		ArrayList<ArrayList<Integer>> divisible = new ArrayList<ArrayList<Integer>>();
		for(int i = 0; i <= n; i++){
			divisible.add(new ArrayList<Integer>());
		}
		for(int i = 1; i <= n; i++){
			int j = 1;
			while(i*j <= n){
				divisible.get(i*j).add(i);
				j++;
			}
		}
		for(int i = 2; i <= k; i++){
			for(int j = 1; j<=n; j++){
				for(int a = 0; a < divisible.get(j).size(); a++){
					dp[i][j] += dp[i-1][j/divisible.get(j).get(a)];
					dp[i][j] = dp[i][j]%MOD;
				}
			}
		}
		long ans = 0;
		for(int i = 1; i<= n; i++){
			ans+=dp[k][i];
		}
		System.out.println(ans%MOD);
		
	}
	static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st = new StringTokenizer(" ");
	static String readString() throws Exception{
		while(!st.hasMoreTokens()){
			st = new StringTokenizer(stdin.readLine());
		}
		return st.nextToken();
	}
	static int readInt() throws Exception {
		return Integer.parseInt(readString());
	}
	static long readLong() throws Exception {
		return Long.parseLong(readString());
	}
	
}