#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;


ll factorial(int n)
{
    ll fact = n;

    if (n <= 0) return 1;

    while (--n)
        fact *= n;

    return fact;
}

ll combi(int n, int r)
{
    if (r <= 0) return 1;
    return factorial(n) / (factorial(r) * factorial(n - r));
}

int main() {
   ll n, k;
   cin >> n >> k;
   rep(i ,n){

   cout << combi(n, k) << endl;
   return 0;
}  