#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
typedef pair<ll, ll> P;
//typedef pair<int, pair<int, int>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
ll INFL = 1LL << 60;//10^18 = 2^60
int INF = 1 << 30;//10^9
ll MOD  = 1000000007;
vector<int> dy = {0,0,1,-1};
vector<int> dx = {1,-1,0,0};
//vector<int> dy = {1, 1, 1, 0, -1, -1, -1, 0};
//vector<int> dx = {1, 0, -1, -1, -1, 0, 1, 1};

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}


//約数の列挙O(√n)
vector<ll> divisor(ll n){
  vector<ll> xs;
    for(int i = 1; i <= sqrt(n); i++){
      xs.push_back(i);
      xs.push_back(n/i);
      if(n/i+1 <= n) xs.push_back(n/i+1);
    }
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    return xs;

}

ll dp[110][100000];

ll can[100000];

int main(){
  ll N, K; cin >> N >> K;

  vector<ll> div = divisor(N);
  dp[1][0] = 1;
  for(int i = 1; i < div.size(); i++){
    dp[1][i] = div[i] - div[i-1];
    dp[1][i] %= MOD;
  }
  vector<ll> mdiv = div;
  rep(i, mdiv.size()) mdiv[i] = -mdiv[i];
  sort(mdiv.begin(), mdiv.end());

  for(int i = 0; i < div.size(); i++){
    can[i] = div.size() - (lower_bound(mdiv.begin(), mdiv.end(), -N/div[i]) - mdiv.begin());
  }

  ll sum[100010][2];
  sum[0][0] = 0;
  for(int i = 0; i < 100010-1; i++){
    sum[i+1][0] = sum[i][0] + dp[1][i];
    sum[i+1][0] %= MOD;
  }

  for(int i = 2; i <= K; i++){
    for(int j = 0; j < div.size(); j++){
      dp[i][j] += dp[1][j] * sum[can[j]][0] % MOD;
      dp[i][j] %= MOD;
      sum[j+1][1] += sum[j][1] + dp[i][j];
      sum[j+1][1] %= MOD;
    }

    for(int j = 0; j < 100010; j++){
      sum[j][0] = sum[j][1];
      sum[j][1] = 0;
    }
  }
  ll ans = 0;
  rep(i, div.size()){
    ans += dp[K][i];
    ans %= MOD;
  }
  cout << ans << endl;
}


Measured memory_bytes: 82420