#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void FastInputOutput() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void ReadFromFile(string name, string extention) {
  string fullPath = name + "." + extention;
  freopen(fullPath.c_str(), "r", stdin);
}
inline int D() {
  int t;
  scanf("%d", &t);
  return t;
}
inline long long LLD() {
  long long t;
  scanf("%lld", &t);
  return t;
}
inline char C() {
  char c;
  scanf("%c", &c);
  return c;
}
inline long long power(long long x, long long p, long long m) {
  long long res = 1;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
long double ModLog(long double base, long double x) {
  return (logl(x) / logl(base));
}
int gcd(int a, int b) {
  if (!b) return a;
  return gcd(b, a % b);
}
const int N = 2e3 + 5;
long long p = 1e9 + 7;
int dp[N][N];
int n, k;
int solve(int curr, int cnt) {
  if (cnt == k) return 1;
  int &ret = dp[curr][cnt];
  if (~ret) return ret;
  ret = 0;
  for (int i = 1; i * curr <= n; ++i) {
    ret += solve(curr * i, cnt + 1);
    if (ret > p) ret -= p;
  }
  return ret;
}
int main() {
  memset(dp, -1, sizeof(dp));
  n = D(), k = D();
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += solve(i, 1);
    if (ans > p) ans -= p;
  }
  printf("%d", (ans + p) % p);
  return 0;
}
