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

public class D240 {

	static int n;
	static int k;

	static int mod = 1000000007;
	static int dp[][] = new int[2010][2010];

	static int solve(int kk, int num) {
		if (kk == k)
			return 1;
		else if (dp[kk][num] != -1)
			return dp[kk][num];
		else {
			int ans = 0;
			for (int i = num; i <= n; i += num)

				ans = (ans % mod + solve(kk + 1, i) % mod) % mod;
			return dp[kk][num] = ans;
		}

	}

	public void run() throws IOException {

		// Scanner in = new Scanner(System.in);
		// n = in.nextint();
		// k = in.nextint();

		BufferedReader bReader = new BufferedReader(new InputStreamReader(
				System.in));
		StringTokenizer tokenizer = new StringTokenizer(bReader.readLine());
		n = Integer.parseInt(tokenizer.nextToken());
		k = Integer.parseInt(tokenizer.nextToken());

		for (int i = 0; i < dp.length; i++)
			for (int j = 0; j < dp[i].length; j++)
				dp[i][j] = -1;

		// int ans = 0;
		// for (int i = 1; i <= n; i++)
		// ans = (ans % mod + solve((int) k, i) % mod) % mod;
		System.out.println(solve(0, 1));

	}

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		new D240().run();

	}

}