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 unsigned long long mod = 1000000007LL;
unsigned long long dp[2047][2047];
int main() {
  iostream::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= k; i++) dp[i][1] = 1;
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int high = 2; high <= n; high++) {
    vector<int> divs;
    for (int i = 1; i <= high; i++)
      if (high % i == 0) divs.push_back(i);
    for (int pos = 2; pos <= k; pos++)
      for (int i = 0; i < divs.size(); i++)
        dp[pos][high] += dp[pos - 1][divs[i]], dp[pos][high] %= mod;
  }
  unsigned long long sum = 0;
  for (int i = 1; i <= n; i++) sum = (sum + dp[k][i]) % mod;
  cout << sum << endl;
  return 0;
}