import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //
void solve(){
	int n = read.to!int;
	int k = read.to!int;
	
	Finite[][] xs = new Finite[][](k + 2, n + 1);
	foreach(i; 0 .. k + 2) foreach(j; 0 .. n + 1) {
		if(i > j) xs[i][j] = Finite(0);
		else if(i == j) xs[i][j] = Finite(1);
		else if(i == 0) xs[i][j] = Finite(0);
		else xs[i][j] = xs[i][j - 1] + xs[i - 1][j - 1];
	}
	
	foreach(i; 1 .. k + 1){
		Finite ans = xs[i][k] * xs[i - 1][n - k]
			+ xs[i][k] * xs[i][n - k] * 2 
			+ xs[i][k] * xs[i + 1][n - k];
		
		ans.writeln;
	}
}

/*

求めるものは
・青がi箇所で赤が(i - 1)箇所
・青がi箇所で赤がi箇所
・青がi箇所で赤がi箇所で
・青がi箇所で赤が(i + 1)箇所で
の合計。

xs[i][j]: j個の玉をi箇所に分ける分け方

・(j - 1)個をi箇所に分けたものをもとに、最後の島にたす
・(j - 1)個を(i - 1)箇所に分けたものをもとに、最後に島をたす
*/
class Finite{ ulong value; static ulong mod = 1_000_000_007;
	private static ulong[] _inv = [0, 1], _frac = [1, 1], _invfrac = [1, 1];
	this(ulong v){ value = v % mod; }
	bool opCast(T: bool)(){ return value != 0; }
	Finite opUnary(string s){ ulong v;
		if(s == "+") v = value;
		else if(s == "-") v = mod - value;
		else if(s == "++") v = value + 1;
		else if(s == "--") v = value + mod - 1;
		else assert(0, "Operator unary " ~ s ~ " not implemented");
		return new Finite(v);
	}
	Finite opBinary(string s)(Finite b){
		return opBinary!s(b.value);
	}
	Finite opBinary(string s)(ulong u){ ulong v;
		if(s == "+") v = value + u;
		else if(s == "-") v = value + mod - u;
		else if(s == "*") v = value * u;
		else if(s == "/") v = value * inv(u);
		else assert(0, "Operator " ~ s ~ " not implemented");
		return new Finite(v);
	}
	Finite opBinaryRight(string s)(ulong u){ ulong v;
		if(s == "+") v = u + value;
		else if(s == "-") v = u + mod - value;
		else if(s == "*") v = u * value;
		else if(s == "/") v = u * invvalue;
		else assert(0, "Operator " ~ s ~ " not implemented");
		return new Finite(v);
	}
	Finite opAssign(ulong v){ value = v; return this; }
	Finite opOpAssign(string s)(Finite b){
		return opOpAssign!s(b.value);
	}
	Finite opOpAssign(string s)(ulong v){
		if(s == "+") value = (value + v) % mod;
		else if(s == "-") value = (value + mod - v) % mod;
		else if(s == "*") value = (value * v) % mod;
		else if(s == "/") value = (value * inv(v)) % mod;
		else assert(0, "Operator " ~ s ~ "= not implemented");
		return this;
	}
	override bool opEquals(Object o){
		Finite b = cast(Finite) o;
		return(value == b.value);
	}
	override string toString(){ return value.to!string; }
	ulong inv(ulong v){
		assert(v > 0);
		assert(v < mod);
		while(v >= _inv.length){
			_inv ~= _inv[mod % $] * (mod - mod / _inv.length) % mod;
		}
		return _inv[v];
	}
	ulong invvalue(){
		return inv(value);
	}
	static Finite opCall(ulong v){
		return new Finite(v);
	}
}


Measured memory_bytes: 162684