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

public class B {
	private static final int MOD = (int) 1e9 + 7;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt(), k = sc.nextInt();
		sc.close();

		int[][] dp = new int[n + 1][k + 1];
		for (int last = 1; last <= n; last++)
			dp[last][1] = 1;
		for (int last = 1; last <= n; last++)
			for (int len = 1; len < k; len++)
				if (dp[last][len] > 0)
					for (int num = last; num <= n; num += last)
						dp[num][len + 1] = add(dp[num][len + 1], dp[last][len]);

		int res = 0;
		for (int last = 1; last <= n; last++)
			res = add(res, dp[last][k]);
		System.out.println(res);
	}

	private static int add(int num1, int num2) {
		int sum = num1 + num2;
		return sum >= MOD ? sum - MOD : sum;
	}
}