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

Solution (in CPP):

Solution:
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>

#define FOR(i,a,b) for(lint i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()

typedef long long lint;

using namespace std;
lint p=1e9+7;

int main(){
  lint N,K;
  cin>>N>>K;
  set<lint> s;
  FOR(i,1,sqrt(N)+1){
    if(s.find(N/i)==s.end()){
      s.insert(i);
      s.insert(N/i);
    }
  }
  vector<lint> v;
  for(auto e:s)v.push_back(e);
  lint M=v.size();
  lint dp[M][K];
  dp[0][0]=1;
  FOR(i,1,M){
    dp[i][0]=(dp[i-1][0]+1*(v[i]-v[i-1]))%p;
  }
  FOR(k,1,K){
    dp[0][k]=dp[M-1][k-1];
    FOR(i,1,M){
      dp[i][k]=(dp[i-1][k]+dp[M-1-i][k-1]*(v[i]-v[i-1]))%p;
    }
  }
  // REP(i,K){
  //   REP(j,M)cerr<<dp[j][i]<<" ";
  //   cerr<<endl;
  // }
  cout<<dp[M-1][K-1]<<endl;
  return 0;
}