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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long ans, d[2001][2001], n, k1, k, i, j;
vector<int> div1[2001];
int main() {
  cin >> n >> k;
  for (i = 1; i <= n; i++) d[1][i] = 1;
  for (i = 1; i <= n; i++) {
    for (k1 = 1; k1 * k1 <= i; k1++)
      if (i % k1 == 0) {
        div1[i].push_back(k1);
        if (k1 * k1 != i) div1[i].push_back(i / k1);
      }
  };
  for (i = 2; i <= k; i++)
    for (j = 1; j <= n; j++) {
      for (k1 = 0; k1 < div1[j].size(); k1++)
        d[i][j] = (d[i - 1][div1[j][k1]] + d[i][j]) % 1000000007;
    };
  for (i = 1; i <= n; i++) ans = (ans + d[k][i]) % 1000000007;
  cout << ans;
  return 0;
}