/* imports all std modules {{{*/
import
  std.algorithm,
  std.array,
  std.ascii,
  std.base64,
  std.bigint,
  std.bitmanip,
  std.compiler,
  std.complex,
  std.concurrency,
  std.container,
  std.conv,
  std.csv,
  std.datetime,
  std.demangle,
  std.encoding,
  std.exception,
  std.file,
  std.format,
  std.functional,
  std.getopt,
  std.json,
  std.math,
  std.mathspecial,
  std.meta,
  std.mmfile,
  std.net.curl,
  std.net.isemail,
  std.numeric,
  std.parallelism,
  std.path,
  std.process,
  std.random,
  std.range,
  std.regex,
  std.signals,
  std.socket,
  std.stdint,
  std.stdio,
  std.string,
  std.system,
  std.traits,
  std.typecons,
  std.uni,
  std.uri,
  std.utf,
  std.uuid,
  std.variant,
  std.zip,
  std.zlib;
/*}}}*/

/* libmod {{{*/
struct ModCalc(N) if (isIntegral!N) {
 public:
  N mod(N n) const {
    const x = n%m;
    return x < 0? x+m: x;
  }
  N inv(N a) const {
    N b = m, u = 1, v = 0;
    while (b) {
      const t = a / b;
      a -= t*b; swap(a, b);
      u -= t*v; swap(u, v);
    }
    return mod(u);
  }

  N add(N l, N r) const {
    return mod(mod(l) + mod(r));
  }
  N sub(N l, N r) const {
    return mod(mod(l) - mod(r));
  }
  N mul(N l, N r) const {
    return mod(mod(l) * mod(r));
  }
  N div(N l, N r) const {
    assert(r != 0);
    return mod(mod(l) * inv(mod(r)));
  }

  N m = 1000000007;
}
/*}}}*/

/+---test
5 3
---+/
/+---test
2000 3
---+/

void main(string[] args) {
  long N, K;
  readf(" %d %d ", &N, &K);

  long[4000] facts;
  facts[0] = 1;

  const ModCalc!long M;

  foreach (i; 1..4000) {
    facts[i] = M.mul(facts[i-1], i);
  }

  long f(long x) {
    return x >= 0? facts[x]: 0;
  }

  foreach (i; 1..K+1) {
    const num1 = M.div(f(N-K+1), f(N-K+1-i));
    const den1 = f(i);

    const num2 = M.div(f(K-1), f(K-1-(i-1)));
    const den2 = f(i-1);

    M.mul(M.div(num1, den1), M.div(num2, den2)).writeln;
  }
}
