#include <bits/stdc++.h>

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;
 
public:
  u64 a;
 
  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>

ll n,cnt,a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
U_MAP nanban;
V yakusuu;
U_MAP zyu;

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
        cin.tie(0);
        cout.tie(0);
    ios::sync_with_stdio(false);

    using mint=modint<MOD>;

    cin>>n>>k;
    rrep(i,1,n+1){
      ll le=i,ri=n,mid;
      while(ri-le>1){
        mid=(le+ri)/2;
        if(n/i>n/mid)ri=mid;
        else if(n/i<=n/mid)le=mid;
      }
      tmp=-1;
      rrep(j,max(le-3,1LL),min(ri+3,n+1)){
        if(n/i==n/j){
          tmp=j;
          break;
        }
      }
      if(tmp==-1)tmp=min(ri+2,n);
      while(1){
        //Cout(tmp);
        if(tmp==n)break;
        tmp++;
        if(n/tmp!=n/i){
          tmp--;
          break;
        }
      }
      i=tmp;
      //Cout(i);
      yakusuu.push_back(i);
    }
    rep(i,Size(yakusuu)){
      nanban[yakusuu[i]]=i;
    }
    vector<vector<mint>> dp(k+100,vector<mint>(Size(yakusuu)+100));
    rep(i,Size(yakusuu)){
        dp[1][i]=(i==0 ? 1LL : yakusuu[i]-yakusuu[i-1] );
        if(i!=0)dp[1][i]+=dp[1][i-1];
    }
    rrep(i,2,k+1){
      rep(j,Size(yakusuu)){
        dp[i][j]+=dp[i-1][nanban[n/yakusuu[j]]]*(j==0 ? 1LL : yakusuu[j]-yakusuu[j-1] );
        if(j!=0)dp[i][j]+=dp[i][j-1];
      }
    }
    Cout(dp[k][Size(yakusuu)-1].value());
    return 0;
}


Measured memory_bytes: 103440