#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, k;
int dp[2005][2005];

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    freopen("TEST.inp", "r", stdin);
    freopen("TEST.out", "w", stdout);
    cin >> n >> k;

    for (int i = 1; i <= n; i++) dp[1][i] = 1;
    for (int i = 2; i <= k; i++) {
        for (int j = 1; j <= n; j++) {
            for (int id = j; id <= n; id += j) {
                dp[i][id] += dp[i - 1][j];
                if (dp[i][id] >= MOD) dp[i][id] -= MOD;
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans += dp[k][i];
        if (ans >= MOD) ans -= MOD;
    }

    cout << ans << '\n';

    return 0;
}
