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.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;


public class DIV_1_240B {

	static HashMap<Integer, ArrayList<Integer>> divisors;
	static final int MOD = 1000000007;
	static long[][] mem;
	
	public static long numberOfSequences(int n, int k) {
		
		if (k == 1) {
			return 1;
		}
		if (mem[n][k] != -1) {
			return mem[n][k];
		}
		long ans = 0;
		for (int m : divisors.get(n)) {
			ans += numberOfSequences(m, k-1) % MOD;
		}
		
		mem[n][k] = ans;
		return ans;
		
	}
	
	public static long solve(int n, int k) {
		
		divisors = buildDivisors(n);
		mem = new long[n + 1][k + 1];
		long ans = 0;
		
		for (int i = 0; i <= n; ++ i) {
			Arrays.fill(mem[i], -1L);
		}	
				
		for (int i = 1; i <= n; ++ i) {
			ans += numberOfSequences(i, k) % MOD;
		}
		
		return ans;
		
	}
	
	private static HashMap<Integer, ArrayList<Integer>> buildDivisors(int n) {
		
		HashMap<Integer, ArrayList<Integer>> divisors = new HashMap<>();
		for (int number = 1; number <= n; ++ number) {
			divisors.put(number, getFactors(number));
		}		
		return divisors;
		
	}
	
	public static ArrayList<Integer> getFactors(int n) {
		
		ArrayList<Integer> factors = new ArrayList<>();
		int m = (int) Math.sqrt(n);
		
		for (int i = 1; i <= m; ++i) {
			if (n % i == 0) {
				factors.add(i);
				if (n / i != i) {
					factors.add(n / i);
				}
			}
		}
		
		return factors;
		
	}

	public static void main(String[] args) throws IOException {
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		System.out.println(solve(n, k) % MOD);
		
	}
	
}