#include <bits/stdc++.h>
using namespace std;
long long w, j, i, m, n, a[2005][2005], k;
vector<int> v[2010];
int main() {
  scanf("%d %d", &m, &n);
  for (i = 1; i <= m; i++) {
    a[i][1] = 1;
  }
  for (i = 1; i <= m; i++) {
    for (j = 1; j * j <= i; j++) {
      if (i % j != 0) continue;
      if (j * j != i) {
        v[i].push_back(j);
        v[i].push_back(i / j);
      } else
        v[i].push_back(j);
    }
  }
  for (j = 1; j <= n; j++) {
    for (i = 1; i <= m; i++) {
      for (w = 0; w < v[i].size(); w++) {
        a[i][j] = (a[i][j] + a[v[i][w]][j - 1]) % 1000000007;
      }
    }
  }
  for (i = 1; i <= m; i++) k = (k + a[i][n]) % 1000000007;
  cout << k % 1000000007;
}
