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;
const long long maxn = 2000 + 100;
const long long mode = 1000000000 + 7;
long long dp[maxn][maxn];
bool mark[maxn][maxn];
vector<long long> v[maxn];
long long calc(long long n, long long k) {
  if (k == 1) return 1;
  if (mark[n][k]) return dp[n][k];
  long long ret = 0;
  for (long long i = 0; i < v[n].size(); i++) {
    ret += calc(v[n][i], k - 1);
    if (ret > mode) ret %= mode;
  }
  dp[n][k] = ret;
  mark[n][k] = true;
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  long long n, k;
  for (long long i = 1; i <= 2000; i++)
    for (long long j = 1; j * j <= i; j++) {
      if (i % j != 0) continue;
      v[i].push_back(j);
      if (i / j != j) v[i].push_back(i / j);
    }
  cin >> n >> k;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += calc(i, k);
    if (ans > mode) ans %= mode;
  }
  cout << ans;
}