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>
const int fx[] = {+1, -1, +0, +0};
const int fy[] = {+0, +0, +1, -1};
using namespace std;
long long dp[2020][2020];
int n, k;
vector<int> divs[2020];
long long call(int num, int taken) {
  if (taken == k) return 1;
  if (dp[num][taken] != -1) return dp[num][taken];
  long long &val = dp[num][taken];
  val = 0;
  for (int i : divs[num]) {
    val = (val + call(i, taken + 1)) % 1000000007;
  }
  return val;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j += i) {
      divs[i].push_back(j);
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = (ans + call(i, 1)) % 1000000007;
  }
  cout << ans << endl;
}