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.*;
import java.util.*;

public class ACM {
	
	final static int mod = 1000000007;

	public static void main(String[] args) {
		Scan scan = new Scan();
		int n = scan.nextInt(),k = scan.nextInt();
		int[][] chart = new int[2001][2001];
		for(int i=1;i<=n;i++){
			chart[1][i] = 1;
		}
		for(int i=2;i<=k;i++){
			for(int j=1;j<=n;j++){
				int multiplier = 1;
				while(j*multiplier <= n){
					chart[i][j*multiplier] = (chart[i][j*multiplier] + chart[i-1][j]) % mod;
					multiplier++;
				}
			}
			//for(int j=1;j<n;j++) chart[i][j+1] = (chart[i][j]+chart[i][j+1]) % mod;
		}
		//out(n,k,chart);
		int result = 0;
		for(int i=1;i<=n;i++) result = (result + chart[k][i]) % mod;
		System.out.println(result);
	}
	
	static void out(int n,int k,int[][] chart){
		for(int i=1;i<=k;i++){
			for(int j=1;j<=n;j++) System.out.print(chart[i][j]+" ");
			System.out.println();
		}
	}

}


class Scan{

	BufferedReader buffer;
	StringTokenizer tok;

	public Scan(){
		buffer = new BufferedReader(new InputStreamReader(System.in));
	}

	boolean hasNext(){
		while(tok == null || !tok.hasMoreElements()){
			try{
				tok = new StringTokenizer(buffer.readLine());
			}catch(Exception e){
				return false;
			}
		}
		if(tok == null) return false;
		return true;
	}

	String next(){
		if(hasNext()) return tok.nextToken();
		return null;
	}

	String nextLine(){
		if(hasNext()) return tok.nextToken("\n\r");
		return null;
	}

	int nextInt(){
		return Integer.parseInt(next());
	}

	long nextLong(){
		return Long.parseLong(next());
	}

	double nextDouble(){
		return Double.parseDouble(next());
	}

}