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.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Main {
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader scn = new InputReader(inputStream);
        PrintWriter pw = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(scn, pw);
        pw.close();
    }
}

class Task{
    public static void solve(InputReader scn, PrintWriter pw)
    {
        int n = scn.nextInt(), k = scn.nextInt();
        int base = 1000000007;
        long ans = 0;
        long[][] dp = new long[k + 2][n + 2];
        ArrayList<ArrayList<Integer>> cnt = new ArrayList<ArrayList<Integer>>();
        for (int i = 0; i < n + 2; i++)
            cnt.add(new ArrayList<Integer>());
        for (int i = 0; i < k + 2; i++)
            for (int j = 0; j < n + 2; j++)
                dp[i][j] = 0;
        for (int i = 1; i <= n; i++)
            for (int j = i; j <= n; j += i)
                cnt.get(j).add(i);
        for (int i = 1; i <= n; i++)
            dp[1][i] = 1;
        for (int i = 2; i <= k; i++)
            for (int j = 1; j <= n; j++)
            {
                long add = 0;
                for (int u = 0; u < cnt.get(j).size(); u++)
                {
                    add += dp[i-1][cnt.get(j).get(u)];
                    add %= base;
                }
                dp[i][j] = add;
            }
        for (int i = 1; i<= n; i++)
        {
            ans += dp[k][i];
            ans %= base;
        }
        pw.println(ans);
    }
}
    

class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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