#include <bits/stdc++.h>
const int INF=1e9;
const int MOD=1e9+7;
//const int MOD=998244353;
const long long LINF=1e18;
using namespace std;
#define int long long
//template
int dp[105][100005];
//main
signed main(){
  int N,K;cin>>N>>K;
  std::vector<int> v;
  for(int i=1;i*i<=N;i++)v.push_back(N/i-N/(i+1));
  int sum=0;
  for(int p:v)sum+=p;
  while(sum++<N)v.push_back(1);
  int S=v.size();
  memset(dp,0,sizeof(dp));
  dp[0][0]++;
  for(int i=0;i<K;i++){
    for(int j=0;j<S-1;j++)dp[i][j+1]+=dp[i][j],dp[i][j+1]%=MOD;
    for(int j=0;j<S;j++)dp[i+1][j]=dp[i][S-1-j]*v[S-1-j]%MOD;

  }
  int ans=0;
  for(int j=0;j<S;j++)ans+=dp[K][j],ans%=MOD;
  cout<<ans<<endl;
}

### 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>
const int INF=1e9;
const int MOD=1e9+7;
//const int MOD=998244353;
const long long LINF=1e18;
using namespace std;
#define int long long
//template
int dp[105][100005];
//main
signed main(){
  int N,K;cin>>N>>K;
  std::vector<int> v;
  for(int i=1;i*i<=N;i++)v.push_back(N/i-N/(i+1));
  int sum=0;
  for(int p:v)sum+=p;
  while(sum++<N)v.push_back(1);
  int S=v.size();
  memset(dp,0,sizeof(dp));
  dp[0][0]++;
  for(int i=0;i<K;i++){
    for(int j=0;j<S-1;j++)dp[i][j+1]+=dp[i][j],dp[i][j+1]%=MOD;
    for(int j=0;j<S;j++)dp[i+1][j]=dp[i][S-1-j]*v[S-1-j]%MOD;

  }
  int ans=0;
  for(int j=0;j<S;j++)ans+=dp[K][j],ans%=MOD;
  cout<<ans<<endl;
}

```