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

 
 public class Main	{
   static class Pair implements Comparable<Pair>{
   int a;
   int b;
   public Pair(int x,int y){a=Math.min(x, y);b=Math.max(x, y);}
   public Pair(){}
   public int compareTo(Pair p){
	 return p.a - a;
   }
@Override
public int hashCode() {
	final int prime = 31;
	int result = 1;
	result = prime * result + a;
	result = prime * result + b;
//	out.println("hashcode = "+result);
	return result;
}
@Override
public boolean equals(Object obj) {
	Pair cur = (Pair)obj;
	if((a==cur.a && b==cur.b) || (a==cur.b && b==cur.a))return true;
	return false;
}
 }
   static class cell implements Comparable<cell>{
	   int a,b;
	   long dis;
	   public cell(int x,int y,long z) {a=x;b=y;dis=z;}
	   public int compareTo(cell c) {
		   return Long.compare(dis,c.dis);
	   }
   }
static class TrieNode{
	TrieNode left;
	TrieNode right;
	int op;
	int data;
	public TrieNode() {}
}
  public static long gcd(long a,long b)
  {
    if(a<b)

      return gcd(b,a);
    if(b==0)
      return a;
    return gcd(b,a%b);
    
  }
  static long lcm(long a,long b) {
	  return a*b / gcd(a,b);
  }
  //static long ans = 0;
  static long mod = (long)(1e9+7);///998244353;
   
    public static void main(String[] args) throws Exception {
       new Thread(null, null, "Anshum Gupta", 99999999) {
            public void run() {
                try {
                    solve();
                } catch(Exception e) {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }

static long pow(long x,long y){
    if(y == 0)return 1;
    if(y==1)return x;
    long a = pow(x,y/2);
    a = (a*a)%mod;
    if(y%2==0){
        return a;
    }
    return (a*x)%mod;
}

static long mxx;
static int mxN = (int)(3e5+5);
static long[]fact,inv_fact;
static long my_inv(long a) {
	return pow(a,mod-2);
}
static long bin(int a,int b) {
	if(a < b || a<0 || b<0)return 0;
    return ((fact[a]*inv_fact[a-b])%mod * inv_fact[b])%mod;
}
//static ArrayList<ArrayList<Integer>>adj;
//static boolean[]vis;
//static Long[]p;
//static long val;
//
//static int[]bfs(int a){
//	Queue<Integer> q = new  LinkedList<Integer>();
//	
//	vis = new boolean[n+1];
//	int[]dis = new int[n+1];
//	q.add(a);
//	dis[a] = 0;
//	vis[a] = true;
//	while(!q.isEmpty()) {
//		int cur = q.poll();
//	//	vis[cur] = true;
//	//	if(cur == b)break;
//		for(int x : adj.get(cur)) {
//			if(vis[x])continue;
//			q.add(x);
//			dis[x] = dis[cur]+1;
//			vis[x] = true;
//		}
//	}
//	return dis;
//}
static int n,k;
static long[][]dp;
static long rec(int i,int prev) {
	if(prev > n)return 0;
	if(i == k) {
		if(prev <= n && prev>=1)return 1;
		else return 0;
	}
	if(dp[i][prev]!=-1)return dp[i][prev];
	long ans = 0;
    for(int j=prev;j<=n;j+=prev) {
    	ans += rec(i+1,j);
    	ans %= mod;
    }
    return dp[i][prev] =  ans;
}
 public static void solve() throws Exception {
   // solve the problem here
   MyScanner s = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        int tc = 1;//s.nextInt();
        mxx = (long)(1e18+5);
//       fact=new long[mxN];
//       inv_fact = new long[mxN];
//       fact[0]=inv_fact[0]=1L;
//       for(int i=1;i<mxN;i++) {
//    	   fact[i] = (i*fact[i-1])%mod;
//    	   inv_fact[i] = my_inv(fact[i]);
//       }
       
        while(tc-->0){
        	n = s.nextInt();
        	k = s.nextInt();
        	dp = new long[k][n+1];
        	for(int i=0;i<k;i++)Arrays.fill(dp[i], -1);
        	long ans = rec(0,1);
        	out.println(ans);
        }
        	
           
        out.flush();
}
 
     
 
 
 
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
 
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
         
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    //--------------------------------------------------------
}