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

public class B implements Runnable {
	
	final long MOD = 1000000000 + 7;
	
	private void solve() throws IOException {
		int n = nextInt(), k = nextInt();
		long[][] dp = new long[k + 1][n + 1];
		for (int i = 1; i <= n; i++)
			dp[1][i] = 1;
		for (int len = 1; len < k; len++)
			for (int last = 1; last <= n; last++)
				for (int mul = 1; mul * last <= n; mul++) {
					dp[len + 1][mul * last] += dp[len][last];
					dp[len + 1][mul * last] %= MOD;
				}
		long ans = 0;
		for (int i = 1; i <= n; i++) {
			ans += dp[k][i];
			ans %= MOD;
		}
		print(ans);
	}
	
	public static void main(String[] args) {
		new B().run();
	}
	
	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;
	
	public void run() {
		try {
			String file = "";
			file = "console";
			if (file.equals("console")) {
				reader = new BufferedReader(new InputStreamReader(System.in));
				writer = new PrintWriter(System.out);
			} else if (file.equals("")) {
				reader = new BufferedReader(new FileReader(new File("input.txt")));
				writer = new PrintWriter(new File("output.txt"));
			} else {
				reader = new BufferedReader(new FileReader(new File(file + ".in")));
				writer = new PrintWriter(new File(file + ".out"));
			}
			solve();
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(261);
		}
	}
	
	void halt() {
		writer.close();
		System.exit(0);
	}
	
	void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0) writer.print(' ');
			writer.print(objects[i]);
		}
	}
	
	void println(Object... objects) {
		print(objects);
		writer.println();
	}
	
	String nextLine() throws IOException {
		return reader.readLine();
	}
	
	String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(nextLine());
		return tokenizer.nextToken();
	}
	
	int nextInt() throws NumberFormatException, IOException {
		return Integer.parseInt(nextToken());
	}
	
	long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(nextToken());
	}
	
	double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}