#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string toString(T a) {
  ostringstream os("");
  os << a;
  return os.str();
}
template <typename T>
inline long long toLong(T a) {
  long long res;
  istringstream os(a);
  os >> res;
  return res;
}
template <typename T>
inline T S(T a) {
  return a * a;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <typename T>
inline unsigned long long bigmod(T a, T b, T m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return S(bigmod(a, b / 2, m)) % m;
  else
    return (a % m * bigmod(a, b - 1, m)) % m;
}
template <typename T>
inline vector<string> parse(T str) {
  vector<string> res;
  string s;
  istringstream os(str);
  while (os >> s) res.push_back(s);
  return res;
}
template <typename T>
inline unsigned long long dist(T A, T B) {
  unsigned long long res =
      (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y);
  return res;
}
template <typename T>
inline double cosAngle(T a, T b, T c) {
  double res = a * a + b * b - c * c;
  res = res / (2 * a * b);
  res = acos(res);
  return res;
}
template <typename T>
inline T power(T base, int po) {
  T res = 1;
  if (base == 0) return 0;
  for (int i = (0); i < (po); i++) res *= base;
  return res;
}
template <typename T>
inline bool isOn(T mask, T pos) {
  return mask & (1 << pos);
}
template <typename T>
inline int Off(T mask, T pos) {
  return mask ^ (1 << pos);
}
template <typename T>
inline int On(T mask, T pos) {
  return mask | (1 << pos);
}
long long arr[10005];
vector<int> v[5000];
long long dp[2005][2005];
int Size[2005];
int N;
int main() {
  int i, j, k;
  int n, q;
  long long x, y;
  int ks, cas;
  int kk;
  cin >> n >> kk;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= i; j++) {
      if (i % j == 0) {
        v[i].push_back(j);
      }
    }
  }
  for (i = 0; i <= n; i++) {
    Size[i] = v[i].size();
  }
  memset(dp, 0, sizeof dp);
  for (i = 1; i <= n; i++) {
    dp[1][i] = 1;
  }
  for (i = 2; i <= kk; i++) {
    for (j = 1; j <= n; j++) {
      for (k = 0; k < Size[j]; k++) {
        dp[i][j] = (dp[i][j] + dp[i - 1][v[j][k]]) % 1000000007;
      }
    }
  }
  long long res = 0;
  for (i = 1; i <= n; i++) {
    res = (res + dp[kk][i]) % 1000000007;
  }
  cout << res << endl;
  return 0;
}
