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

/**
 * Created by ali on 3/30/14.
 */
public class B
{
	private final static int MOD = 1000000007;
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int k = in.nextInt();

		int [][] dp = new int[k+1][n+1];
		dp[0][1] = 1;

		for(int till = 0 ; till < k ; till++)
			for(int last = 1 ; last <= n ; last++)
				if(dp[till][last] != 0)
					for(int next = last ; next <= n ; next+= last)
					{
						dp[till+1][next] += dp[till][last];
						if(dp[till+1][next] >= MOD)
							dp[till+1][next] -= MOD;
					}

		int res = 0;
		for(int last = 1 ; last <= n ; last++)
		{
			res += dp[k][last];
			if(res >= MOD)
				res -= MOD;
		}

		System.out.println(res);
	}
}