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 <bits/stdc++.h>
#define ll long long
using namespace std;

ll N;
int K;
ll divnum = 1000000007;

int main() {
  cin >> N >> K;
  ll count=0;
  ll *num;

  ll now=1, next;
  vector<int> lens;
  while (now<=N) {
    next = N/(N/now);
    lens.push_back(next-now+1);
    now = next+1;
  }
  ll len_size = lens.size();
  num = new ll[2*len_size];

  ll offset, preoffset=0;
  ll tmp;
  for(int s=0; s<len_size; s++) {
    num[s] = 1;
  }
  for(int k=1; k<K; k++) {
    offset = (k % 2) * len_size;
    tmp = 0;
    for(int s=0; s<len_size; s++) {
      tmp = (tmp + num[preoffset+s]*lens[s]) % divnum;
      num[offset+len_size-1-s] = tmp;
    }
    preoffset = offset;
  }
  
  ll res=0;
  offset = ((K-1) % 2) * len_size;
  for (int s=0; s<len_size; s++) {
    res = (res + num[offset+s]*lens[s]) % divnum;
  }
  cout << res << endl;
}