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 whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.ArrayList;
import java.util.Scanner;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static	long [][] dp = new long[2005][2005];
	public static long n;
	public static long k;
	public static long MOD = 1000000007;
	public static long sum = 0;

	public static long call (long i, long cnt){
	     if (dp[(int)i][(int)cnt]!=-1)  return dp[(int)i][(int)cnt];
	     if (i > n)  return 0;
	 	 if (cnt == k)  return 1;
		 long opt1 = 0;
	      for (long opt = 1; i * opt <= n; ++opt)
	        if (i*opt <= n)  opt1 += call(i * opt, cnt + 1) % MOD;
	       return dp[(int)i][(int)cnt]= opt1 % MOD;
	 }
	public static void main (String[] args) throws java.lang.Exception
	{
	long MX = 1<<32;
	
	    for (int i = 0; i < 2005; i ++){
	      for (int j = 0; j < 2005; j ++){
	        dp[i][j] = -1;
	      }
	    }
	    Scanner sc = new Scanner(System.in);
		 n = sc.nextLong();
		 k = sc.nextLong();
	     for(int i = 1;i <= n; i ++){
	     	
	       sum += call(i,1)  % MOD;
	     }
	      System.out.print(sum % MOD);
	}
}