#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(long long exponent) {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &rhs) { if((val += rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &rhs) { if((val += mod - rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &rhs) { val = (unsigned long long)val * rhs.val % mod; return *this; }
  ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); }
  bool operator==(const ModInt &rhs) const { return val == rhs.val; }
  bool operator!=(const ModInt &rhs) const { return val != rhs.val; }
  bool operator<(const ModInt &rhs) const { return val < rhs.val; }
  bool operator<=(const ModInt &rhs) const { return val <= rhs.val; }
  bool operator>(const ModInt &rhs) const { return val > rhs.val; }
  bool operator>=(const ModInt &rhs) const { return val >= rhs.val; }
  ModInt operator-() const { return ModInt(-val); }
  ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; }
  ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; }
  ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; }
  ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; }
  friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; }
  friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; }
private:
  ModInt inv() const {
    // if (__gcd((int)val, mod) != 1) assert(false);
    unsigned a = val, b = mod; int x = 1, y = 0;
    while (b) {
      unsigned tmp = a / b;
      a -= tmp * b; swap(a, b);
      x -= tmp * y; swap(x, y);
    }
    return ModInt(x);
  }
};
ModInt abs(const ModInt &x) { return x.val; }
struct Combinatorics {
  Combinatorics(int MAX = 5000000) {
    MAX <<= 1;
    fact.resize(MAX + 1);
    fact_inv.resize(MAX + 1);
    fact[0] = 1;
    FOR(i, 1, MAX + 1) fact[i] = fact[i - 1] * i;
    fact_inv[MAX] = ModInt(1) / fact[MAX];
    for (int i = MAX; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
  }
  ModInt nCk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) {
    if (n < 0 || k < 0) return ModInt(0);
    return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
  }
private:
  vector<ModInt> fact, fact_inv;
};

template <typename Abelian>
struct RAQ {
  RAQ(int n, const Abelian UNITY = 0) : n(n), UNITY(UNITY) {
    ++n;
    dat.assign(n, UNITY);
  }

  void add(int left, int right, Abelian value) {
    while (left < n) {
      (dat[left] += value) %= MOD;
      left += left & -left;
    }
    ++right;
    while (right < n) {
      (dat[right] += MOD - value) %= MOD;
      right += right & -right;
    }
  }

  Abelian query(int idx) {
    Abelian res = UNITY;
    while (idx > 0) {
      (res += dat[idx]) %= MOD;
      idx -= idx & -idx;
    }
    return res;
  }

private:
  int n;
  const Abelian UNITY;
  vector<Abelian> dat;
};

template <typename Monoid>
struct StarrySky {
  StarrySky(int sz, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {
    init(sz);
    dat.assign((n << 1) - 1, DEFAULT);
  }

  StarrySky(const vector<Monoid> &a, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {
    int a_sz = a.size();
    init(a_sz);
    dat.resize((n << 1) - 1);
    REP(i, a_sz) dat[n - 1 + i] = a[i];
    for (int i = n - 2; i >= 0; --i) dat[i] = min(dat[(i << 1) + 1], dat[(i << 1) + 2]);
  }

  void add(int a, int b, Monoid value) { add(a, b, value, 0, 0, n); }

  Monoid query(int a, int b) { return query(a, b, 0, 0, n); }

  Monoid value(int idx) {
    idx += n - 1;
    Monoid res = added[idx];
    while (idx > 0) {
      idx = (idx - 1) >> 1;
      (res += added[idx]) %= MOD;
    }
    return res;
  }

private:
  int n = 1;
  const Monoid UNITY, DEFAULT;
  vector<Monoid> dat, added;

  void init(int sz) {
    while (n < sz) n <<= 1;
    added.assign((n << 1) - 1, DEFAULT);
  }

  void add(int a, int b, Monoid value, int node, int left, int right) {
    if (right <= a || b <= left) return;
    if (a <= left && right <= b) {
      (added[node] += value) %= MOD;
    } else {
      add(a, b, value, (node << 1) + 1, left, (left + right) >> 1);
      add(a, b, value, (node << 1) + 2, (left + right) >> 1, right);
      dat[node] = min((dat[(node << 1) + 1] + added[(node << 1) + 1]) % MOD, (dat[(node << 1) + 2] + added[(node << 1) + 2]) % MOD);
    }
  }

  Monoid query(int a, int b, int node, int left, int right) {
    if (right <= a || b <= left) return UNITY;
    if (a <= left && right <= b) return (dat[node] + added[node]) % MOD;
    return min(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right)) + added[node];
  }
};

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, k; cin >> n >> k;
  set<int> st;
  FOR(i, 1, n + 1) {
    if (st.count(i)) break;
    st.emplace(i);
    st.emplace(n / i);
  }
  vector<int> a;
  map<int, int> mpmp;
  for (int e : st) {
    mpmp[e] = a.size();
    a.emplace_back(e);
  }
  int sz = a.size();
  vector<int> len(sz), mp(sz);
  REP(i, sz) {
    len[i] = a[i] - (i == 0 ? 0 : a[i - 1]);
    mp[i] = mpmp[n / a[i]];
  }

  // vector<RAQ<long long> > dp(k, RAQ<long long>(sz, 0));
  // dp[0].add(1, sz, 1);
  // REP(i, k - 1) REP(j, sz) {
  //   int len = a[j] - (j == 0 ? 0 : a[j - 1]);
  //   long long now = dp[i].query(j + 1) * len % MOD;
  //   dp[i + 1].add(1, mp[n / a[j]] + 1, now);
  //   cout << a[j] << ' ' << now << ' ' << mp[n / a[j]] + 1 << '\n';
  // }
  // REP(i, k) {
  //   FOR(j, 1, sz + 1) cout << dp[i].query(j) << ' ';
  //   cout << '\n';
  // }
  // long long ans = 0;
  // REP(i, sz) {
  //   int len = a[i] - (i == 0 ? 0 : a[i - 1]);
  //   (ans += dp[k - 1].query(i + 1) * len % MOD) %= MOD;
  // }

  vector<StarrySky<long long> > dp(k, StarrySky<long long>(sz, LINF));
  dp[0].add(0, sz, 1);
  REP(i, k - 1) REP(j, sz) {
    long long now = dp[i].value(j) * len[j] % MOD;
    dp[i + 1].add(0, mp[j] + 1, now);
  }
  // REP(i, k) {
  //   REP(j, sz) cout << dp[i].value(j) << ' ';
  //   cout << '\n';
  // }
  long long ans = 0;
  REP(i, sz) {
    (ans += dp[k - 1].value(i) * len[i] % MOD) %= MOD;
  }
  cout << ans << '\n';
  return 0;

  // vector<vector<long long> > dp2(k, vector<long long>(n + 1, 0));
  // FOR(j, 1, n + 1) dp2[0][j] = 1;
  // REP(i, k - 1) FOR(j, 1, n + 1) {
  //   FOR(l, 1, n + 1) {
  //     if (j * l <= n) dp2[i + 1][l] += dp2[i][j];
  //   }
  // }
  // REP(i, k) {
  //   FOR(j, 1, n + 1) cout << dp2[i][j] << ' ';
  //   cout << '\n';
  // }
}


Measured memory_bytes: 214652