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

public class D {
    static BufferedReader in;
    static PrintWriter out;
    static {
        try {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter(new FileWriter("output.txt"));
        } catch (Exception e) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        }
    }
    static StringTokenizer st;
    static String nextString() {
        while(st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(in.readLine());
            } catch (IOException e) {
                System.err.println("Truble in reading");
            }
        }
        return st.nextToken();
    }
    static int nextInt() {
        return Integer.valueOf(nextString());
    }
    static long nextLong() {
        return Long.valueOf(nextString());
    }
    public static void main(String[] args) {
        int n = nextInt();
        int k = nextInt();
        int MOD = 1000000007;
        int[][] d = new int[n+1][k+1];
        for(int i = 1; i <= n; i++) {
            d[i][1] = 1;
        }
        for(int i = 2; i <= k; i++) {
            for(int j = 1; j <= n; j++) {
                for(int kk = 1; kk*kk <= j; kk++) {
                    if (j % kk == 0) { 
                        d[j][i] = (d[j][i] + d[kk][i-1]) % MOD;
                        if (kk*kk < j)
                            d[j][i] = (d[j][i] + d[j/kk][i-1]) % MOD;
                    }
                }
            }
        }
        int res = 0;
        for(int i = 1; i <= n; i++) {
            res = (res + d[i][k]) % MOD;
        }
        out.println(res);
        close();
    } 

    static void close() {
        try {
            in.close();
        } catch (IOException e) {
        }
        out.flush();
        out.close();
    }
}