#include<bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

int main(){
  int N, K;
  cin >> N >> K;
  
  vector<int> d(1, 0);
  for(int i = 1; i * i <= N; i++){
    d.push_back(i);
    if(i * i != N) d.push_back(N / i);
  }
  
  sort(d.begin(), d.end());
  
  int m = (int)d.size() - 1;
  vector<vector<long long>> dp(K + 1, vector<long long>(m, 0));
  dp[0][0] = 1;
  
  vector<long long> sum(m + 1, 1);
  sum[0]=0;
  
  for(int i = 0; i < K; i++){
    for(int j = 0; j < m; j++){
      dp[i + 1][j] += sum[m - j] * (d[j + 1] - d[j]) % mod;
      dp[i + 1][j] %= mod;
    }
    for(int j = 0; j < m; j++){
      sum[j + 1] = (sum[j] + dp[i + 1][j]) % mod;
    }
  }
  
  cout << sum[m] << endl;
  
  return 0;
}
### Prompt

Generate a CPP solution to the following problem:

Find the number of sequences of length K consisting of positive integers such that the product of any two adjacent elements is at most N, modulo 10^9+7.

Constraints

* 1\leq N\leq 10^9
* ~~1~~ 2\leq K\leq 100 (fixed at 21:33 JST)
* N and K are integers.

Input

Input is given from Standard Input in the following format:


N K


Output

Print the number of sequences, modulo 10^9+7.

Examples

Input

3 2


Output

5


Input

10 3


Output

147


Input

314159265 35


Output

457397712

### Response

```cpp
#include<bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

int main(){
  int N, K;
  cin >> N >> K;
  
  vector<int> d(1, 0);
  for(int i = 1; i * i <= N; i++){
    d.push_back(i);
    if(i * i != N) d.push_back(N / i);
  }
  
  sort(d.begin(), d.end());
  
  int m = (int)d.size() - 1;
  vector<vector<long long>> dp(K + 1, vector<long long>(m, 0));
  dp[0][0] = 1;
  
  vector<long long> sum(m + 1, 1);
  sum[0]=0;
  
  for(int i = 0; i < K; i++){
    for(int j = 0; j < m; j++){
      dp[i + 1][j] += sum[m - j] * (d[j + 1] - d[j]) % mod;
      dp[i + 1][j] %= mod;
    }
    for(int j = 0; j < m; j++){
      sum[j + 1] = (sum[j] + dp[i + 1][j]) % mod;
    }
  }
  
  cout << sum[m] << endl;
  
  return 0;
}
```