/* -*- coding: utf-8 -*-
 *
 * 1281.cc:  No.1281 Cigarette Distribution - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  printf("%d\n", n);

  for (int x = 2; x <= m; x++) {
    int q = (n + 1) / x, r = (n + 1) % x;

    int ans = 0;
    if (q >= 2) {
      // (q - 1) * q^(x-r-1) * (q+1)^r
      ans = (ll)(q - 1) * powmod(q, x - r - 1) % MOD * powmod(q + 1, r) % MOD;
    }

    printf("%d\n", ans);
  }
  return 0;
}