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 final class masmokh_and_acm
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static int n,k;
	static long[][] dp;
	static long mod=(long)(1e9+7);
	static ArrayList<Integer>[] al;
	static int maxn=2001;
	
	static void build()
	{
		for(int i=1;i<maxn;i++)	
		{
			al[i]=new ArrayList<Integer>();al[i].add(1);
		}
		for(int i=2;i<maxn;i++)
		{
			for(int j=i;j<maxn;j+=i)
			{
				al[j].add(i);
			}
		}
	}
	
	@SuppressWarnings("unchecked")
	public static void main(String args[]) throws Exception
	{
		n=sc.nextInt();k=sc.nextInt();dp=new long[n+1][k+1];al=new ArrayList[maxn];
		build();
		for(int i=1;i<=n;i++)
		{
			dp[i][1]=1;
		}
		for(int i=2;i<=k;i++)
		{
			for(int j=1;j<=n;j++)
			{
				for(int x:al[j])
				{
					dp[j][i]=(dp[x][i-1]+dp[j][i])%mod;
				}
			}
		}
		long res=0;
		for(int i=1;i<=n;i++)
		{
			res=(res+dp[i][k])%mod;
		}
		out.println(res);
		out.close();
	}
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}