#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)

[[maybe_unused]] constexpr ll MOD = 1000000007;

ll mpow(ll x, ll e) {
  ll res = 1;
  while (e > 0) {
    if (e & 1) res = res * x % MOD;
    x = x * x % MOD;
    e >>= 1;
  }
  return res;
}

int main() {
  int n, m;
  cin >> n >> m;
  rep(i, 1, m + 1) {
    ll q = (n + 1) / i;
    ll r = (n + 1) % i;
    // rの箱にq+1, 1個の箱にq-1,
    cout << mpow(q + 1, r) * (q - 1) * mpow(q, i - r - 1) % MOD << '\n';
  }
  return 0;
}