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.*;
import java.io.*;
import java.math.BigInteger;

public class E {

	static boolean[] vis;
	static int[] cat;
	static int n;
	static int k;
	static int d;
	static ArrayList<Integer>[] a;
	static pair[] p;

	static long memo[][];

	static long dp(int idx, int s, int pre) {
		if (s == k)
			return memo[s][pre] = 1;
		if (idx > n)
			return 0;

		if (memo[s][pre] != -1)
			return memo[s][pre];
		long t = 0;
		if (s == 0 || idx % pre == 0)
			t = dp(idx, s + 1, idx);
		long l = dp(idx+pre, s, pre);
		return memo[s][pre] = (t + l) % (1000000007);

	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		k = sc.nextInt();
		memo = new long[k+1][n + 1];
		for (int i = 0; i <= k; i++)
			Arrays.fill(memo[i], -1);
		long ans=0;
		for(int i=1;i<=n;i++) {
			ans=(ans+dp(i,1,i))%1000000007;
		}
		pw.println(ans);

		pw.flush();
		pw.close();
	}

	static class pair implements Comparable<pair> {
		int x;
		int y;

		public pair(int d, int u) {
			x = d;
			y = u;
		}

		@Override
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
			if (x == o.x)
				return y - o.y;
			return x - o.x;
		}

	}
}