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.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

   public static void main(String[] args) throws IOException {
      // TODO Auto-generated method stub
      FastScanner sc = new FastScanner(System.in);
      int n = sc.nextInt();
      int k = sc.nextInt();
      int[][] measure = new int[n+1][n+1];
      long[][] dp = new long[k+1][n+1];
      for(int i=1;i<=n;i++){
         int count = 1;
         for(int j=1;j<=i;j++){
            if(i%j==0){
               measure[i][count++]=j;
            }
         }
      }
      
      Arrays.fill(dp[1], 1);
      
      for(int i=2;i<=k;i++){
         for(int j=1;j<=n;j++){
            for(int a=1;a<=n+1;a++){
               if(measure[j][a]==0)
                  break;
               dp[i][j] = dp[i][j]+dp[i-1][measure[j][a]];   
               dp[i][j] = dp[i][j]%1000000007;
            }
         } 
      }
      
      long sum = 0;
      for(int i=1;i<=n;i++){
         sum += dp[k][i];
      }
      
      System.out.println(sum%1000000007);
      
   }
   static class FastScanner {
      BufferedReader br;
      StringTokenizer st;

      public FastScanner(InputStream i) {
         br = new BufferedReader(new InputStreamReader(i));
         st = new StringTokenizer("");
      }
      
      public String nextLine() throws IOException{
         return br.readLine();
      }

      public String next() throws IOException {
         if (st.hasMoreTokens())
            return st.nextToken();
         else
            st = new StringTokenizer(br.readLine());
         return next();
      }

      public int nextInt() throws IOException {
         return Integer.parseInt(next());
      }

      public long nextLong() throws IOException {
         return new Long(next());
      }

      public double nextDouble() throws IOException {
         return new Double(next());
      }
      public void close() throws IOException
      {
         br.close();
      }
   }
}