#include <bits/stdc++.h>
using namespace std;
int dp[2010][2010];
const int Mod = 1000000007;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    dp[0][i] = 1;
  }
  for (int i = 0; i < m - 1; i++) {
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= n / j; k++) {
        int ne = j * k;
        dp[i + 1][ne] += dp[i][j];
        if (dp[i + 1][ne] >= Mod) {
          dp[i + 1][ne] -= Mod;
        }
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[m - 1][i];
    if (ans >= Mod) ans -= Mod;
  }
  printf("%d\n", ans);
  return 0;
}
