#include <bits/stdc++.h>   using namespace std;   vector<int> divi[2002];   long long dp[2002][2002];   int main() {     int n, k;     cin >> k >> n;     int i, j;     for (i = 1; i <= k; i++) {       for (j = i; j <= k; j += i) divi[i].push_back(j);     }     for (i = 1; i <= n; i++) {       for (j = 1; j <= k; j++) {         if (i == 1)           dp[i][j] = 1;         else {           for (int x : divi[j]) dp[i][j] += dp[i - 1][x], dp[i][j] %= 1000000007;         }       }     }     long long ans = 0;     for (i = 1; i <= k; i++) ans += dp[n][i], ans %= 1000000007;     cout << ans <<   n ;     return 0;   }   