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

/**
 * @author : soumitri12
 */

public class Solution {
    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (final IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (final IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static class Pair {
        int ff, ss;

        public Pair(int ff, int ss) {
            this.ff = ff;
            this.ss = ss;
        }
    }

    static final long MOD = 1000000007;

    public static void main(final String[] args) {
        final FastReader sc = new FastReader();
        final PrintWriter out = new PrintWriter(System.out);
        StringBuffer sb = new StringBuffer();
        // your code starts here
        int n = sc.nextInt(), m = sc.nextInt();
        long dp[][] = new long[m + 1][n + 1];
        for (int i = 0; i <= m; i++) {
            for (int j = 0; j <= n; j++)
                dp[i][j] = 0;
        }
        Arrays.fill(dp[1], 1);

        for (int i = 2; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                for (int k = j; k <= n; k += j)
                    dp[i][k] = (dp[i][k] + dp[i - 1][j]) % MOD;
            }
        }
        long ans = 0;
        for (int i = 1; i <= n; i++)
            ans = (ans + dp[m][i]) % MOD;

        out.println(ans);

        out.close();
    }
}