using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

internal partial class Solver {
    public void Run() {
        var N = ni();
        var K = ni();
        var mod = 1000000000 + 7;
        var C = new Binomial(3000, mod);

        var Red = N - K;
        var Blue = K;

        if (N == K) {
            for (int i = 1; i <= K; i++) {
                cout.WriteLine(i == 1 ? 1 : 0);
            }
        } else {
            for (int i = 1; i <= K; i++) {
                long ans = 0;
                var blueDivide = Divide(C, Blue, i);
                long redDevide = 0;

                redDevide += Divide(C, Red, i - 1);
                redDevide += Divide(C, Red, i) * 2;
                redDevide += Divide(C, Red, i + 1);
                redDevide %= mod;

                ans += blueDivide * redDevide;
                ans %= mod;

                cout.WriteLine(ans);
            }
        }
    }

    private long Divide(Binomial c, int n, int groupNum) {
        if (groupNum < 0) return 0;
        n -= groupNum;
        if (n < 0) return 0;
        return c[n + groupNum - 1, n];
    }

    public class Binomial {
        private readonly long[] factorial;
        private readonly long[] inverseFactorial;
        private readonly long[] inverse;
        private readonly int mod;

        public Binomial(int size, int primeMod) {
            size++;
            factorial = new long[size];
            inverseFactorial = new long[size];
            inverse = new long[size];
            mod = primeMod;
            Setup(size);
        }

        private void Setup(int size) {
            factorial[0] = factorial[1] = 1;
            inverseFactorial[0] = inverseFactorial[1] = 1;
            inverse[1] = 1;
            for (int i = 2; i < size; i++) {
                factorial[i] = factorial[i - 1] * i % mod;
                inverse[i] = (mod - (mod / i) * inverse[mod % i] % mod);
                inverseFactorial[i] = inverseFactorial[i - 1] * inverse[i] % mod;
            }
        }

        private long Get(int s, int t) {
            if (s < 0 || t < 0 || s < t) {
                return 0;
            }

            if (t == 0 || s == t) {
                return 1;
            }

            if (s >= mod) {
                return Get(s % mod, t % mod) * Get(s / mod, t / mod) % mod; // Lucas' theorem
            }

            return factorial[s] * inverseFactorial[t] % mod * inverseFactorial[s - t] % mod;
        }

        public long this[int s, int t] {
            get {
                return Get(s, t);
            }
        }
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

    public void RunMulti() {
        while (HasNext()) {
            Run();
        }
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (var i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        var array = new double[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (var token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 11268