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.InputStreamReader;
import java.util.*;

public class Main {
    static List<List<Integer>> arr = new ArrayList<List<Integer>>(2000);

    public static void main(String[] args) {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        Scanner sc = new Scanner(br);
        int n = sc.nextInt();
        int k = sc.nextInt();
        for (int i = 1; i <= n + 1; i++) {
            List<Integer> tempList = new ArrayList<Integer>();
            for (int j = 1; j <= i; j++) {
                if (i % j == 0) {
                    tempList.add(j);
                }
            }
            arr.add(tempList);
        }
        long x = ACM.test(n, k);

        if (x > -1) {
            System.out.println(x);
        } else {
            Pair dp[][] = new Pair[n + 1][k + 1];
            for (int i = 0; i <= k; i++) {
                dp[1][i] = new Pair(1, 1);
            }
            for (int i = 0; i <= n; i++) {
                dp[i][1] = new Pair(i, 1);
            }
            int p = 0;
            for (int j = 2; j <= k; j++) {
                for (int i = 2; i <= n; i++) {
                    long total = 0;
                    for (int temp : getAllDevisors(i)) {
                        p++;
                        total += dp[temp][j - 1].getAnsOfEndingTillNow();
                    }
                    dp[i][j] = new Pair(total + dp[i - 1][j].getAnswer(), total);
                }
            }
            System.out.println(dp[n][k].getAnswer());
        }
        // for (int i = 1; i <= n; i++) {
        // for (int j = 1; j <= k; j++) {
        // System.out.print(dp[i][j].getAnsOfEndingTillNow() + " ");
        // }
        // System.out.println();
        // for (int j = 1; j <= k; j++) {
        // System.out.print(dp[i][j].getAnswer() + " ");
        // }
        // System.out.println();
        // }
    }

    private static List<Integer> getAllDevisors(int i) {
        return arr.get(i - 1);
    }
}

class ACM {
    private static int mod = 1000000007;

    public static long test(int n, int k) {
        long dp[][] = new long[k + 1][2001];
        for (int i = 1; i <= n; i++)
            dp[1][i] = 1;
        for (int i = 1; i <= k; i++) {
            for (int j = 1; j <= n; j = j + 1) {
                for (int p = j; p <= n; p = p + j) {
                    dp[i][p] = (dp[i][p] + dp[i - 1][j]) % mod;
                }
            }
        }
        long sum = 0;
        for (int i = 1; i <= n; i++) {
            sum = (sum + dp[k][i]) % mod;

        }
        return sum;
    }
}

class Pair {
    private long answer;
    private long ansOfEndingTillNow;
    private static long mod = 1000000007;

    public Pair(long answer, long ansOfEndingTillNow) {
        this.answer = answer % mod;
        this.ansOfEndingTillNow = ansOfEndingTillNow % mod;
    }

    public long getAnsOfEndingTillNow() {
        return ansOfEndingTillNow;
    }

    public long getAnswer() {
        return answer;
    }
}