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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Nasko
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        long[][] dp = new long[2001][2001];
        long MOD = 1000000007;
        int N;
        int K;
        ArrayList<Integer>[] adj = new ArrayList[2001];

        public void solve(int testNumber, InputReader in, PrintWriter out) {

            for (long[] ini : dp) Arrays.fill(ini, -1);
            N = in.nextInt();
            K = in.nextInt();
            for (int i = 0; i < 2001; ++i) adj[i] = new ArrayList<Integer>();
            for (int j = 1; j <= 2000; ++j) {
                for (int z = j; z <= 2000; ++z) if (z % j == 0) adj[j].add(z);
            }

            long ret = 0L;
            for (int start = 1; start <= N; ++start) {
                ret += go(start, 1);
                ret %= MOD;
            }
            out.println(ret % MOD);

        }

        private long go(int cur, int len) {
            if (len == K) return 1L;
            if (dp[cur][len] != -1) return dp[cur][len] % MOD;
            long ways = 0L;
            for (int i = 0; i < adj[cur].size() && (adj[cur].get(i) <= N); ++i) ways += go(adj[cur].get(i), len + 1);
            return dp[cur][len] = ways % MOD;
        }

    }

    static 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());
        }

    }
}