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;

public class Mashmokh_and_ACM {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int m = 1000000007;

		String[] st = br.readLine().split(" ");
		int n = Integer.parseInt(st[0]);
		int k = Integer.parseInt(st[1]);

		int[][] dp = new int[k + 1][n + 1];
		for (int j = 1; j <= n; j++) {
			dp[1][j] = 1;
		}

		for (int i = 2; i <= k; i++) {
			for (int j = 1; j <= n; j++) {
				for (int fact1 = 1; fact1 * fact1 <= j; fact1++) {
					if (j % fact1 == 0) {
						int fact2 = j / fact1;

						dp[i][j] = (dp[i][j] % m + dp[i - 1][fact1] % m) % m;

						if (fact1 != fact2) {
							dp[i][j] = (dp[i][j] % m + dp[i - 1][fact2] % m) % m;
						}
					}
				}
			}
		}

		int sum = 0;
		for (int i = 1; i <= n; i++) {
			sum = (sum % m + dp[k][i] % m) % m;
		}

		System.out.println(sum);

	}

	static long[][] ncrcoll(int n, int k, int p) {
		long[][] arr = new long[n + 1][k + 1];
		for (int i = 1; i < arr.length; i++) {
			arr[i][0] = 1;
		}
		for (int i = 1; i < arr.length; i++) {
			for (int j = 1; j <= i && j < arr[0].length; j++) {
				if (i == 1 && j == 1) {
					arr[i][j] = 1;
				} else {
					arr[i][j] = (arr[i - 1][j] + arr[i - 1][j - 1]) % (p);
				}
			}
		}
		return arr;
	}

	public static long xpown(long x, long n) {
		long res = 1;
		while (n > 0) {
			if (n % 2 != 0) {
				res = (res * x) % 1000000007;
				n--;
			} else {
				x = (x * x) % 1000000007;
				n = n / 2;
			}
		}
		return res;
	}

	public static int[] arrayinput(BufferedReader br) throws NumberFormatException, IOException {
		int n = Integer.parseInt(br.readLine());

		int[] arr = new int[n];

		String[] temp = br.readLine().split(" ");

		for (int i = 0; i < arr.length; i++) {
			arr[i] = Integer.parseInt(temp[i]);
		}

		return arr;

	}

	public static class Pair implements Comparable<Pair> {
		int a;
		int b;

		Pair(int x, int y, int gcd) {
			this.a = x;
			this.b = y;
		}

		@Override
		public int compareTo(Pair o) {
			// TODO Auto-generated method stub
			return 0;
		}
	}

}