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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(
                outputStream, "ASCII"));
        CustomScanner sc = new CustomScanner(inputStream);
        solve(sc, out);
        out.flush();
        out.close();
    }

    static void solve(CustomScanner sc, BufferedWriter out) throws IOException {
        final int MOD = 1000000007;
        int n = sc.nextInt(), k = sc.nextInt();
        int[][] dp = new int[n+1][k+1];
        for (int i=1; i<=n; i++)
        {
            for (int j=1; j<k; j++)
            {
                dp[i][j]=(dp[i][j]==0)?1:dp[i][j];
                for (int l=i; l<=n; l+=i)
                    dp[l][j+1]=(int)(((long)dp[l][j+1]+dp[i][j])%MOD);
            }
            dp[i][k]=(dp[i][k]==0)?1:dp[i][k];
        }
        int ways = 0;
        for (int i=1; i<=n; i++)
            ways = (int)((ways + (long)dp[i][k])%MOD);
        out.write(Integer.toString(ways));
    }

    static class CustomScanner {
        BufferedReader br;
        StringTokenizer st;

        public CustomScanner(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
        }

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

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

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

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

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