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 div2_240;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class MashmokhandACM {
    public static List<List<Integer>> div=new ArrayList<>();
    public static int dp[][]=new int[2003][2003];
    public static final int mod=1000000007;
    public static void main(String[] args) {
        Scanner inp=new Scanner(System.in);
        int n=inp.nextInt(),k=inp.nextInt();
        for(int i=0;i<=n;i++) div.add(new ArrayList<>());
        for(int i=1;i<=n;i++){ if(i>1)div.get(i).add(1);div.get(i).add(i);}
        for(int i=2;i*i<=n;i++){
            div.get(i*i).add(i);
            for(int j=i+1;i*j<=n;j++){
                div.get(i*j).add(i);
                div.get(i*j).add(j);
            }
        }
        for(int l=1;l<=k;l++){
            for(int curval=n;curval>=1;curval--){               
                if(l==1){ dp[curval][l]=1;continue;}
                int sz=div.get(curval).size();
                for(int i=0;i<sz;i++){
                    dp[curval][l]+=dp[div.get(curval).get(i)][l-1];
                    dp[curval][l]%=mod;
                }
            }
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            ans+=dp[i][k];
            ans%=mod;
        }
        System.out.println(ans);
        inp.close();

    }

}