using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;

namespace ABC132D
{
    class Program
    {
        static void Solve(Input input)
        {
            var n = input.NextInt();

            var k = input.NextInt();
            var blue = k;
            var red = n - blue;

            var mc = new ModCom(tableSize: 1000000);
            for (int i = 1; i <= k; i++)
            {
                if (i > blue)
                {
                    Console.WriteLine("0");
                    continue;
                }
                if (i - 1 > red)
                {
                    Console.WriteLine("0");
                    continue;
                }

                var m = new ModInt(1);
                // 青い玉をi個の箱に入れる（空き箱無し）
                m *= mc.Ncr(blue - 1, i - 1);

                // 赤い玉をi+1個の箱に入れる（両端だけ空き箱あり）
                // -> 赤い玉-(i-1)個の玉をi+1個の箱に入れる（空き箱あり）
                m *= mc.Ncr(red - (i - 1) + i + 1 - 1, i + 1 - 1);

                Console.WriteLine(m);
            }
        }

        /// <summary>
        /// Mを法とする数値
        /// Mは素数
        /// </summary>
        public struct ModInt
        {
            public readonly int M;
            private readonly int N;

            /// <summary>
            /// 
            /// </summary>
            /// <param name="n">実際の数値</param>
            /// <param name="mod">M</param>
            public ModInt(int n, int mod = (int)1e9 + 7)
            {
                N = n % mod;
                M = mod;
            }

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Add(int a, int b, int M)
                => new ModInt((a + b) % M, M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Sub(int a, int b, int M)
                => new ModInt((a + M - b) % M, M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Mul(int a, int b, int M)
                => new ModInt((int)(((long)(a % M) * (b % M)) % M), M);

            /// <summary> a/b </summary>
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Div(int a, int b, int M)
                => Mul(a, Inverse(b, M), M);

            /// <summary>
            /// aの逆元（a^-1）
            /// （厳密には違うが）Mは素数とする
            /// </summary>
            public static ModInt Inverse(int a, int M)
            {
                int b = M;
                int u = 1, v = 0;

                while (b > 0)
                {
                    int t = a / b;
                    a -= t * b;
                    Swap(ref a, ref b);
                    u -= t * v;
                    Swap(ref u, ref v);
                }

                u %= M;
                if (u < 0) u += M;

                return new ModInt(u, M);
            }

            /// <summary>
            /// x^y
            /// 繰り返し二乗法
            /// </summary>
            public static ModInt Power(int a, int b, int M)
            {
                var r = new ModInt(1, M);

                while (b > 0)
                {
                    if ((b & 1) != 0) r = Mul(r, a, M);

                    a = Mul(a, a, M);
                    b >>= 1;
                }

                return r;
            }

            public override string ToString() => N.ToString();

            #region Combinatorics
            /// <summary>
            /// 階乗(n!)
            /// </summary>
            public static ModInt Factorial(int n, int M)
            {
                var fact = new ModInt(1, M);
                while (n > 0)
                {
                    fact *= n;
                    n--;
                }

                return fact;
            }

            /// <summary>
            /// 順列(nPr)
            /// </summary>
            public static ModInt Npr(int n, int r, int M)
            {
                if (n < r || n < 0 || r < 0)
                {
                    return new ModInt(0, M);
                }

                var npr = new ModInt(1, M);
                for (int i = n; i > n - r; i--)
                {
                    npr *= n;
                }

                return npr;
            }

            /// <summary>
            /// 組み合わせ(nCr)
            /// </summary>
            public static ModInt Ncr(int n, int r, int M)
            {
                if (n < r || n < 0 || r < 0)
                {
                    return new ModInt(0, M);
                }

                r = Math.Min(r, n - r);
                var npr = Npr(n, r, M);
                var fact = Factorial(r, M);

                return npr / fact;
            }

            /// <summary>
            /// 重複組み合わせ(nHr)
            /// n個から重複を許してr個取り出す
            /// </summary>
            public static ModInt Nhr(int n, int r, int M)
                => Ncr(n + r - 1, r, M);
            #endregion

            #region Operator, Alias
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static implicit operator int(ModInt a)
                => a.N;

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator +(ModInt a, int b)
                => Add(a, b, a.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator -(ModInt a, int b)
                => Sub(a, b, a.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator *(ModInt a, int b)
                => Mul(a, b, a.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator /(ModInt a, int b)
                => Div(a, b, a.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator +(int a, ModInt b)
                => Add(a, b, b.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator -(int a, ModInt b)
                => Sub(a, b, b.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator *(int a, ModInt b)
                => Mul(a, b, b.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator /(int a, ModInt b)
                => Div(a, b, b.M);

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator +(ModInt a, ModInt b)
            {
                if (a.M != b.M) throw new ArgumentException();
                return Add(a, b, a.M);
            }

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator -(ModInt a, ModInt b)
            {
                if (a.M != b.M) throw new ArgumentException();
                return Sub(a, b, a.M);
            }

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator *(ModInt a, ModInt b)
            {
                if (a.M != b.M) throw new ArgumentException();
                return Mul(a, b, a.M);
            }

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt operator /(ModInt a, ModInt b)
            {
                if (a.M != b.M) throw new ArgumentException();
                return Div(a, b, a.M);
            }

            /// <summary> a^b </summary>
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Power(ModInt a, int b)
                => Power(a, b, a.M);

            /// <summary> a^b </summary>
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Power(ModInt a, ModInt b)
            {
                if (a.M != b.M) throw new ArgumentException();
                return Power(a, b, a.M);
            }

            /// <summary> n! </summary>
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            public static ModInt Factorial(ModInt n)
                => Factorial(n, n.M);

            #endregion

            #region Misc
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            static void Swap<T>(ref T a, ref T b)
            {
                T temp = a;
                a = b;
                b = temp;
            }
            #endregion
        }

        /// <summary>
        /// Mを法とする数値によるCombinationなど
        /// Mは素数
        /// </summary>
        public class ModCom
        {
            public readonly int M;
            // 階乗テーブル
            private int[] factorials;
            // 逆元テーブル
            private int[] invs;
            // 階乗の逆元テーブル
            private int[] finvs;
            // 繰り返し計算するならテーブルを作成する
            // テーブル作るコストもそれなりに大きいので基本は作らない
            private readonly int maxTableSize;

            /// <summary>
            /// 
            /// </summary>
            /// <param name="mod"></param>
            /// <param name="tableSize">作成するテーブル上限</param>
            public ModCom(int mod = (int)1e9 + 7, int tableSize = 0)
            {
                M = mod;
                maxTableSize = tableSize;
            }

            /// <summary>
            /// 順列(nPr)
            /// </summary>
            public int Npr(int n, int r)
            {
                if (n < r || n < 0 || r < 0)
                {
                    return 0;
                }

                if (n <= maxTableSize)
                {
                    MakeTable(n);
                    if (factorials != null && n <= factorials.Length)
                    {
                        return Mul(factorials[n], finvs[n - r]);
                    }
                }

                // テーブルがない or 範囲外のため計算する
                // テーブルがある場合は続きから計算すると定数倍改善
                int npr = 1;
                for (int i = n; i > n - r; i--)
                {
                    npr = Mul(npr, n);
                }

                return npr;
            }

            /// <summary>
            /// 組み合わせ(nCr)
            /// </summary>
            public int Ncr(int n, int r)
            {
                if (n < r || n < 0 || r < 0)
                {
                    return 0;
                }

                r = Math.Min(r, n - r);
                if (n <= maxTableSize)
                {
                    MakeTable(n);
                    if (factorials != null && n <= factorials.Length)
                    {
                        return Mul(Npr(n, r), finvs[r]);
                    }
                }

                // テーブルがない or 範囲外のため計算する
                // テーブルがある場合は続きから計算すると定数倍改善
                int npr = 1, fact = 1;
                for (int i = 0; i < r; i++)
                {
                    npr = Mul(npr, n - i);
                    fact = Mul(fact, i + 1);
                }

                return Div(npr, fact);
            }

            /// <summary>
            /// 重複組み合わせ(nHr)
            /// n個から重複を許してr個取り出す
            /// </summary>
            public int Nhr(int n, int r)
                => Ncr(n + r - 1, r);

            /// <summary>
            /// n以下の各テーブルを作成する
            /// </summary>
            void MakeTable(int n)
            {
                if (n > maxTableSize)
                {
                    throw new ArgumentOutOfRangeException();
                }

                if (factorials == null)
                {
                    factorials = Enumerable.Repeat(1, 2).ToArray();
                    invs = Enumerable.Repeat(1, 2).ToArray();
                    finvs = Enumerable.Repeat(1, 2).ToArray();
                }

                if (n < factorials.Length)
                {
                    return;
                }
                var begin = factorials.Length;

                Array.Resize(ref factorials, n + 1);
                Array.Resize(ref invs, n + 1);
                Array.Resize(ref finvs, n + 1);

                for (int i = begin; i <= n; i++)
                {
                    factorials[i] = Mul(factorials[i - 1], i);
                    invs[i] = M - Mul(invs[M % i], M / i);
                    finvs[i] = Mul(finvs[i - 1], invs[i]);
                }
            }

            #region Misc
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            int Mul(int a, int b)
                => (int)(((long)(a % M) * (b % M)) % M);

            /// <summary> a/b </summary>
            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            int Div(int a, int b)
                => Mul(a, Inverse(b));

            /// <summary>
            /// aの逆元（a^-1）
            /// （厳密には違うが）Mは素数とする
            /// </summary>
            int Inverse(int a)
            {
                int b = M;
                int u = 1, v = 0;

                while (b > 0)
                {
                    int t = a / b;
                    a -= t * b;
                    Swap(ref a, ref b);
                    u -= t * v;
                    Swap(ref u, ref v);
                }

                u %= M;
                if (u < 0)
                {
                    u += M;
                }

                return u;
            }

            [System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
            static void Swap<T>(ref T a, ref T b)
            {
                T t = a;
                a = b;
                b = t;
            }
            #endregion
        }

        #region Competitive Template
        static readonly int MOD = (int)1e9 + 7;

        public static void Main(string[] args)
        {
            // 出力が少ないときはこれをセットする方が時間かかるけれど
            // その場合は出力がボトルネックになっていないので、まあ良しとする
            var needsFlushOutput = true;
            if (needsFlushOutput)
            {
                // 細かく出力しないようにする
                var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
                Console.SetOut(sw);
            }

            // 通常は引数無しで、ファイルから読み出したい場合はpath指定する
            var input = new Input();
            // 仮想的に標準入力をセットする
            //input.SetText("5 4");

            Solve(input);

            Console.Out.Flush();
        }

        class Input
        {
            // 変な改行コードがたまに混じっているので、一応セパレート指定する
            // スペース単独指定の方がもちろん早い
            static readonly char[] separator = { ' ', '\r', '\n' };
            Queue<string> q { get; set; }
            StreamReader sr;

            /// <summary>
            /// 特定のファイルから読み出したい場合はpath指定する
            /// </summary>
            /// <param name="path"></param>
            public Input(string path = "")
            {
                q = new Queue<string>();

                if (string.IsNullOrEmpty(path))
                {
                    sr = new StreamReader(Console.OpenStandardInput());
                }
                else
                {
                    sr = new StreamReader(path);
                }
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="items"></param>
            public void SetText(IEnumerable<string> items)
            {
                foreach (var item in items)
                {
                    SetText(item);
                }
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="s"></param>
            /// <returns></returns>
            public bool SetText(string s)
            {
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                return true;
            }

            /// <summary>
            /// 内部queueに入力からの値をsplitして格納する
            /// </summary>
            /// <returns></returns>
            bool read()
            {
                var s = sr.ReadLine();
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                if (!q.Any()) return read();

                return true;
            }

            /// <summary>
            /// 次のstringを一つ読み込む
            /// </summary>
            /// <returns></returns>
            public string Next()
            {
                if (!q.Any())
                {
                    if (!read())
                    {
                        return "";
                    }
                }

                return q.Dequeue();
            }

            /// <summary>
            /// 指定個数queueにたまるまでenqueueし続ける
            /// </summary>
            /// <param name="n"></param>
            /// <returns></returns>
            bool accumulate(int n)
            {
                while (q.Count() < n)
                {
                    if (!read()) return false;
                }

                return true;
            }

            public int NextInt() => int.Parse(Next());
            public long NextLong() => long.Parse(Next());
            public double NextDouble() => double.Parse(Next());

            /// <summary>
            /// n個の要素をparseして、それぞれにoffsetをaddした配列を返す
            /// </summary>
            /// <typeparam name="T"></typeparam>
            /// <param name="n"></param>
            /// <param name="offset"></param>
            /// <param name="parse"></param>
            /// <param name="add"></param>
            /// <returns></returns>
            T[] NextT<T>(int n, T offset, Func<string, T> parse, Func<T, T, T> add)
            {
                if (!accumulate(n)) return null;

                var a = new T[n];

                for (int i = 0; i < n; i++)
                    a[i] = add(parse(q.Dequeue()), offset);

                return a;
            }

            public string[] Next(int n) => NextT(n, "", x => x, (x, y) => x);
            public int[] NextInt(int n, int offset = 0) => NextT(n, offset, int.Parse, (x, y) => x + y);
            public long[] NextLong(int n, long offset = 0) => NextT(n, offset, long.Parse, (x, y) => x + y);
            public double[] NextDouble(int n, double offset = 0.0) => NextT(n, offset, double.Parse, (x, y) => x + y);
        }

        static class Utils
        {
            public static void Print<T>(IEnumerable<T> ie, string sep = " ") => Console.WriteLine(string.Join(sep, ie));
            public static void Print<T>(params T[] objs) => Print(objs);
            public static T Max<T>(params T[] objs) => objs.Max();
            public static T Min<T>(params T[] objs) => objs.Min();

            public static void Swap<T>(ref T x, ref T y) where T : struct { var t = x; x = y; y = t; }
            public static void Swap<T>(IList<T> list, int i, int j) where T : struct { var t = list[i]; list[i] = list[j]; list[j] = t; }

            /// <summary>
            /// vでfillされたT[d1][d2]配列を作成する
            /// </summary>
            /// <typeparam name="T"></typeparam>
            /// <param name="d1"></param>
            /// <param name="d2"></param>
            /// <param name="v"></param>
            /// <returns></returns>
            public static T[][] Create2DArray<T>(int d1, int d2, T v = default(T))
            {
                return
                    Enumerable.Repeat(0, d1).Select(_ =>
                    Enumerable.Repeat(v, d2).ToArray()).ToArray();
            }

            /// <summary>
            /// vでfillされたT[d1][d2][d3]配列を作成する
            /// </summary>
            /// <typeparam name="T"></typeparam>
            /// <param name="d1"></param>
            /// <param name="d2"></param>
            /// <param name="d3"></param>
            /// <param name="v"></param>
            /// <returns></returns>
            public static T[][][] Create3DArray<T>(int d1, int d2, int d3, T v = default(T))
            {
                return
                    Enumerable.Repeat(0, d1).Select(_ =>
                    Enumerable.Repeat(0, d2).Select(__ =>
                     Enumerable.Repeat(v, d3).ToArray()).ToArray()).ToArray();
            }
        }
        #endregion
    }
}


Measured memory_bytes: 13396