/*
         --┬--  |     |  --┬--                |       |
           |    |\    |    |                  |       |
           |    | \   |    |     ----->       |       |
           |    |  \  |    |                  |       |
           |    |   \ |    |                  |       |
         --┴--  |    \|    |                  └----   └----

*/

#define pragma

#ifdef pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif // pragma

#include<bits/stdc++.h>

#define ll long long
#define all(x) begin(x),end(x)
#define pb push_back
#define INF 9223372036854775807ll;
#define PI 3.14159265359d
#define INPUT "input.txt"
#define OUTPUT "output.txt"
#define sz size
#define rsz resize
#define int long long

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long double ld;

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

ll dp[2000 + 100][2000 + 100];
const ll MOD = 1e9 + 7;

signed main(){
    seriy();
    int n, k;
    cin >> n >> k;

    vector<vector<ll> > precalc(n + 100);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j < sqrt(i) + 1; j++) {
            if(i % j == 0) precalc[i].pb(j);
        }
    }
    for(int i = 0; i < n; i++) {
        dp[1][i] = 1;
    }
    for(int i = 2; i <= k; i++) {
        for(int j = 1; j <= n; j++) {
            for(int f = 0; f < precalc[j].size(); f++) {
                dp[j][i] = (dp[j][i] + dp[j - 1][i / precalc[j][f]] + MOD) % MOD;
            }
        }
    }
    for(int i = 0; i <= n; i++) {
        cout << dp[i][k] << endl;
    }
    return 0;
}