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 Round240_D_Mashmokh_and_ACM {

	long n, k, slon = 0, MAX = 1000000007;
	long[][] grid = new long[2001][2001];

	long dp(int seqSize, int ele) {

		if (seqSize == k)
			return 1;
		else if (ele > n)
			return 0;

		if (grid[seqSize][ele] == -1) {
			grid[seqSize][ele]++;

			for (int i = ele; i <= n; i += ele)
				grid[seqSize][ele] += dp(seqSize + 1, i);

		}
		grid[seqSize][ele] %= MAX;
		return grid[seqSize][ele];
	}

	public void solve(int nn, int kk) {
		for (int i = 0; i < 2001; i++) {
			for (int j = 0; j < 2001; j++) {
				grid[i][j] = -1;
			}
		}
		n = nn;
		k = kk;
		for (int i = 1; i <= n; i++) {
			slon = (slon + dp(1, i)) % MAX;
		}

		System.out.println(slon);

	}

	public static void main(String[] args) {
		Scanner x = new Scanner(System.in);
		new Round240_D_Mashmokh_and_ACM().solve(x.nextInt(), x.nextInt());
	}

}