func_code_string: #include <bits/stdc++.h>   using namespace std;   long long int n, k, dp[2009][2009], cnt;   long long int solve(int pos, int mx) {     if (pos == k) return 1;     long long int &res = dp[pos][mx];     if (res != -1) return res;     res = 0;     int lim = mx;     if (lim == 0) lim = 1;     if (mx == 0) {       for (int i = lim; i <= n; i += lim) {         res += solve(pos + 1, i);         res %= 1000000007;       }     } else {       for (int i = lim; i <= n; i += lim) {         if (i % mx == 0) {           res += solve(pos + 1, i);           res %= 1000000007;         }       }     }     return res;   }   int main() {     cin >> n >> k;     memset(dp, -1, sizeof(dp));     long long int ans = solve(0, 0);     cout << ans << endl;     return 0;   }   