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.*;
import static java.lang.Math.*;
import static java.lang.System.*;
import static java.lang.Integer.*;

public class D {
	public static String[] split(String s) {
		return s.trim().split("\\s+");
	}

	public static void main(String args[]) throws Exception {
		int[][] mat = new int[MAX][MAX];
		
		for(int i=1;i<mat.length;i++) mat[i][1] = mat[1][i] = 1;
		
		for(int i=2;i<mat.length;i++) {
			LinkedList<Integer> list = new LinkedList<Integer>();
			for(int k=1;k<=i;k++) {
				if (i%k==0) list.add(k);
			}
			for(int j=1;j<mat.length;j++) {
				for(int k : list) {
					mat[i][j] += mat[k][j-1];
					mat[i][j] %= MOD;
				}
			}
		}
		for(int i=1;i<mat.length;i++) {
			for(int j=1;j<mat.length;j++) {
				mat[i][j] += mat[i-1][j];
					mat[i][j] %= MOD;
			}
		}
		
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		
		String[] ss = split(br.readLine());
		int n = parseInt(ss[0]);
		int k = parseInt(ss[1]);
		out.println(mat[n][k]);
	}
	
	static int MAX = 2001;
	static int MOD = 1000000007;
}