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:
//package ladder;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;

public class MashmokhAndACM {
	static long mod=1000000007;
	static ArrayList<Integer>[] divid;
	static void div(int n) {
		for(int i=1;i<=n;i++) {
			for(int j=1;j<=n;j++) {
				if(j*i>n)
					break;
				else
					divid[i].add(j*i);
			}
		}
	}
	
	static long[][]memo;
	
	public static long dp(int ind,int lvl) {
		if(lvl==0)
			return 1;
		if(memo[lvl][ind]!=-1)
			return memo[lvl][ind];
		long ans=0;
		for(int i=0;i<divid[ind].size();i++) {
			ans+=dp(divid[ind].get(i),lvl-1);
		}
		return memo[lvl][ind]=ans%mod;
	}
	
	public static void main(String []args) throws Exception{
		BufferedReader br=new BufferedReader(new InputStreamReader (System.in));
		String[]s=br.readLine().split(" ");
		int n=Integer.parseInt(s[0]);
		int k=Integer.parseInt(s[1]);
		divid=new ArrayList[n+1];
		memo=new long[k][n+1];
		for(int i=0;i<memo.length;i++) {
			Arrays.fill(memo[i], -1);
		}
		for(int i=0;i<divid.length;i++) {
			divid[i]=new ArrayList<>();
		}
		div(n);
//		for(int i=0;i<divid.length;i++) {
//			System.out.println(divid[i]);
//		}
		long ans=0;
		for(int i=1;i<=n;i++) {
			ans=(ans+dp(i,k-1))%mod;
		}
		System.out.println(ans);
	}
}