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.io.PrintWriter;
import java.util.Arrays;

public class MashMokhAndACM {
	public static final int MOD = (int)1e9+7;
	public static void main(String[] args) throws IOException {
		HPAllInOne OfficeJet = new HPAllInOne();
		OfficeJet.PowerON();
		String[] in = OfficeJet.scan().split("\\s+");
		int n = Integer.parseInt(in[0]), x = Integer.parseInt(in[1]);
		long[][] dp = new long[x][n+1];
		Arrays.fill(dp[0], 1);
		dp[0][0] = 0;
		for(int i = 1 ; i < x ; i++)
			for(int j = 1 ; j <= n ; j++)
				for(int k = j ; k <= n ; k+=j)
					dp[i][j] += dp[i-1][k]%MOD;
		long res = 0;
		for(int i = 0 ; i <= n ; i++)
			res+=dp[x-1][i]%MOD;
		OfficeJet.Print(res%MOD);
		OfficeJet.PowerOFF();
	}
	static class HPAllInOne{
		class HPCopyMachine extends BufferedReader{
			public HPCopyMachine(){
				super(new InputStreamReader(System.in));
			}                                  //      ___           ___   
		}                                        //     /__/\         /  /\  
		class HPPrinter extends PrintWriter{     //     \  \:\       /  /::\ 
			public HPPrinter(){                //      \__\:\     /  /:/\:\
				super(System.out);           //  ___ /  /::\   /  /:/~/:/
			}                                  // /__/\  /:/\:\ /__/:/ /:/ 
		}                                        // \  \:\/:/__\/ \  \:\/:/ 
		HPCopyMachine c;                         //  \  \::/       \  \::/  
		HPPrinter p;                             //   \  \:\        \  \:\  
		public String scan() throws IOException {//    \  \:\        \  \:\  
			return c.readLine();               //     \__\/         \__\/ 
		}
		public char[][] CopySpreadSheet(int n, int m) throws IOException{
			char[][] SpreadSheet = new char[n][m];
			for(int i = 0 ; i < n ; i++)
				SpreadSheet[i] = c.readLine().toCharArray();
			return SpreadSheet;
		}
		public void NewInkCartridge(){
			p.flush();
		}
		public void Print(Object o){
			p.println(o);
		}
		public void PowerON(){
			c = new HPCopyMachine();
			p = new HPPrinter();
		}
		public void PowerOFF() {
			p.close();
		}
	}
}