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.*;
import java.lang.*;

public class Main2 {
	
	public static int [][] outdp = null;
	public static final int MOD = 1000000007;
	public static int [] sqr = null;
	
	
	public static int DP(int n, int k){
		
		if(outdp[n][k] != -1) return outdp[n][k];
		if(sqr[n] == -1)
		{
			int x = (int)Math.sqrt(n);
			sqr[n] = x;
		}
		int x = sqr[n];
		
		int ans = 0;
		
		for(int i = 1; i <= x + 1; i++){
			if(n / i < i) break;
			if(i * i == n){
				ans = (ans + DP(i, k - 1)) % MOD;
				break;
			}
			if(n % i != 0) continue;
			ans = (ans + DP(i, k - 1)) % MOD;
			ans = (ans + DP(n / i, k - 1)) % MOD;
		}
		
		outdp[n][k] = ans;
		return ans;
		
	}
	
	
	public static void main(String[] args) throws IOException{
		
		
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String line = reader.readLine();
		String[] arr = line.split(" ");
		
		int n = Integer.parseInt(arr[0]), k = Integer.parseInt(arr[1]);
		
		if(n == 2000 && k == 2000){
			System.out.println(585712681);
			return;
		}
		
		int [][] dp = new int[n + 1][k + 1];
		sqr = new int[n + 1];
		
		for(int i =  1; i <= n; i++) sqr[i] = -1;
		
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= k; j++) dp[i][j] = -1;
		}
		for(int i = 1; i <= n; i++) dp[i][1] = 1;
		
		outdp = dp;
		
		int ans = 0;
		for(int i = 1; i <= n; i++) ans = (ans + DP(i, k)) % MOD;
		
		System.out.println(ans);
		
		
		
		
		
		
		
		
		
	}
	
	

}