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.PrintWriter;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = in.nextInt()+1;
        int k = in.nextInt();
        long[][] aux = new long[n][k];
        for(int i=0; i<n; i++){
            for(int j=0; j<k; j++){
                if(j == k-1){
                    aux[i][j] = 1;
                }else{
                    aux[i][j] = -1;
                }
            }
        }
        long total=0;
        for(int i=1; i<n; i++){
            total += findGood(n-1,i,0,aux);
        }
        if(total<0){
            out.println(1000000007L+total);
        }else{
            out.println(total%1000000007L);
        }


//        for(int i=1; i<n; i++){
//            for(int j=0; j<k; j++){
//                out.print(aux[i][j]+" ");
//            }
//            out.println();
//        }
        out.close();
    }

    private static long findGood(int end, int value, int pos,long[][] aux){
        if(aux[value][pos] == -1){
            long sum=0;
            for(int i=value; i<=end; i+=value){
                sum += findGood(end,i,pos+1,aux);
                sum = sum%1000000007L;
            }
            aux[value][pos] = sum;
        }
        return aux[value][pos];
    }
}