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.BitSet;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class CopyOfSolution {

    /**
     * #236 Div1 Problem A
     * #href: http://codeforces.com/contest/403/problem/A
     *
     * @param args
     * @throws NumberFormatException
     * @throws IOException
     */
    public static void main(final String[] args) throws NumberFormatException, IOException {
        final OutputStream outputStream = System.out;
        final PrintWriter out = new PrintWriter(outputStream);
        final InputReader in = new InputReader(System.in);
        final int n = in.nextInt();
        final int k = in.nextInt();
        final long s = System.nanoTime();
        final int[][] val = new int[n + 1][k + 1];
        for (int i = 1; i <= n; i++) {
            val[i][1] = 1;
        }
        for (int j = 1; j < k; j++) {
            for (int i = 1; i <= n; i++) {
                int start = 1;
                while (((long) i * start) <= n) {
                    val[i * start][j + 1] = (int) ((val[i * start][j + 1] + val[i][j]) % MOD);
                    start++;
                }
            }
        }
        long num = 0;
        for (int i = 1; i <= n; i++) {
            num = (num + val[i][k]) % MOD;
        }
        // out.println("TIME=" + ((System.nanoTime() - s) / 1000000));
        out.println(num);
        out.close();
        out.close();
    }

    private static long find(final int s, final int n) {
        int m = 0;
        int s1 = s;
        if (s == 1) {
            return 1;
        }
        while (s1 <= n) {
            m++;
            s1 *= s;
        }
        return m;
    }

    private static long comb(final long n, long r) {
        if (n <= 0) {
            return 0;
        }
        long num = 1;
        long den = 1;
        if (r > n) {
            return 0;
        }
        if (r > (n - r)) {
            r = n - r;
        }
        for (long i = 1; i <= r; i++) {
            num = (num * ((n - i) + 1)) % MOD;
            den = (den * (i)) % MOD;
        }
        return (num * pow(den, MOD - 2)) % MOD;
    }

    private static long pow(long a, long n) {
        long out = 1;
        while (n > 0) {
            if ((n % 2) == 1) {
                out = (out * a) % MOD;
            }
            a = (a * a) % MOD;
            n >>= 1;
        }
        return out;
    }

    private static final long MOD = 1000000007;

    private static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer s;

        public InputReader(final InputStream is) {
            final InputStreamReader in = new InputStreamReader(is);
            final BufferedReader reader = new BufferedReader(in);
            this.reader = reader;
        }

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

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

        public long nextLong() {
            return Long.parseLong(this.next());
        }

        public double nextDouble() {
            return Double.parseDouble(this.next());
        }

    }

}