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

public class MashmokhAndACM
{
	static int mod = 1000000007;
	static int[][] memo;
	static HashMap<Integer, Integer> map;
	static int n;
	static int k;
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		k = sc.nextInt();
		
		memo = new int[n+5][k+5];
		for (int i = 0; i < memo.length; i++)
		{
			Arrays.fill(memo[i], -1);
		}
		int sum = 0;
		for (int i = 1; i <= n; i++)
		{
			sum += r(i, k);
			sum %= mod;
		}
		System.out.println(sum%mod);
		sc.close();
	}
	
	public static ArrayList<Integer> div(int n)
	{
		ArrayList<Integer> arr = new ArrayList<Integer>();
		int root = (int)Math.sqrt(n);
		if(root*root == n)
			arr.add(root);
		for (int i = 1; i*i < n; i++)
		{
			if(n%i == 0)
			{
				arr.add(i);
				arr.add(n/i);
			}
		}
		return arr;
	}
	public static int r(int kk, int z)
	{
		if (z == 1)
			return memo[kk][z] = 1;
		
		int sum = 0;
		for (int j = kk; j <= n; j+=kk)
		{
			if(memo[j][z-1] != -1)
				sum += memo[j][z-1];
			else
				sum += r(j, z-1);
			
			sum %= mod;
		}
		
		return memo[kk][z] = (sum%mod);
		
	}
}