#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T1, class T2>
ostream& operator<<(ostream& s, pair<T1, T2> P) {
  return s << '<' << P.first << ", " << P.second << '>';
}
template <class T>
ostream& operator<<(ostream& s, vector<T> P) {
  for (int i = 0; i < P.size(); ++i) {
    if (i > 0) {
      s << " ";
    }
    s << P[i];
  }
  return s << endl;
}
template <class T1, class T2>
ostream& operator<<(ostream& s, map<T1, T2> P) {
  for (__typeof__((P).begin()) it = (P).begin(); it != (P).end(); ++it) {
    s << "<" << it->first << "->" << it->second << "> ";
  }
  return s << endl;
}
const int MOD = 1000000007;
void add(int& a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
int n, k;
int dp[2100][2100];
int main() {
  while (cin >> n >> k) {
    memset(dp, 0, sizeof(dp));
    dp[0][1] = 1;
    for (int i = 0; i <= k; ++i) {
      for (int j = 1; j <= n; ++j) {
        for (int l = j; l <= n; l += j) {
          add(dp[i + 1][l], dp[i][j]);
        }
      }
    }
    int res = 0;
    for (int i = 1; i <= n; ++i) add(res, dp[k][i]);
    cout << res << endl;
  }
  return 0;
}
