#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
int n, t;
int dp[2010][2010];
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
int f(int i, int t) {
if(t == 1) return 1;
if(dp[i][t] != -1) return dp[i][t];
int ans = 0;
for(int k=i; k<=n; k+=i) {
ans += (f(k, t-1) % MOD);
}
return dp[i][t] = (ans % MOD);
}
void solve() {
cin >> n >> t;
int ans = 0;
memset(dp, -1, sizeof (dp));
for(int i=1; i<=n; i++) ans += (f(i,t) % MOD);
cout << ans << endl;
}
signed main() {
__fastio;
solve();
return 0;
}