Language: C++

// list(map(int, input().rstrip().split()))
//' '.join(map(str, res)) 

#include<bits/stdc++.h>
#include<stdio.h> //per fare input output con scanf and printf
#include<stdlib.h> //per fare qsort e bsearch
#include<string.h> // per fare strcpy(sarrivo, spartenza) strcat(str, aggiungo) strcmp(a,b) che da 0 se sono uguali
#include<math.h>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<map>
 
using namespace std;
 
#define ld long double
#define ll long long int
#define vi vector <ll> 
#define pi pair <int, int>
#define binary(v, el) binary_search((v).begin(), (v).end(), (el))
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define G(n, t) get<(n)>((t)) // get element of a tuple
#define F first
#define S second
#define input(type, n) type n; cin >> n
#define FORN(n) for (ll i=0;i<(n); i++)
#define print(x) cout << x << endl
#include <iomanip>      // std::setprecision



/*struct missione {
        int s;
        int g;
    };
missione v[1000000];
 
bool Ordina (missione a, missione b) {
    return a.s < b.s;    
}*/

ll fatt (ll n, ll p) {
    ll res = 1;
    for (ll i = 1; i < n+1; ++i) {
        res *= i;
        res = res % p;
    }
    return res;
}

ll bin (ll n, ll k, ll p) {
    return (fatt(n) % p) * inverse((fatt(n-k) * fatt(k)), p);
}

ll powermodp(ll x, ll y, ll p){
   // x^y mod p
   if (y==0) return 1;
   ll a = powermodp(x, y/2, p) % p;
   a = (a*a) % p;
   if (y%2) return (a*x)%p;
   else a;
}

ll inverse(ll a, ll p){
   if (a%p == 0) return 0;
   else return powermodp(a, p-2, p);
}

int main () {
    ll N,K;
    ll p = 1000000007;
    for (ll i = 1; i < K+1; ++i) {
        ll res = (bin(K-1,i-1) % p) * (bin(N-K+1, i) % p);
        res = res % p;
        cout << res << endl;
    }
}

Compiler output:
a.cc: In function 'long long int bin(long long int, long long int, long long int)':
a.cc:57:17: error: too few arguments to function 'long long int fatt(long long int, long long int)'
   57 |     return (fatt(n) % p) * inverse((fatt(n-k) * fatt(k)), p);
      |             ~~~~^~~
a.cc:47:4: note: declared here
   47 | ll fatt (ll n, ll p) {
      |    ^~~~
a.cc:57:41: error: too few arguments to function 'long long int fatt(long long int, long long int)'
   57 |     return (fatt(n) % p) * inverse((fatt(n-k) * fatt(k)), p);
      |                                     ~~~~^~~~~
a.cc:47:4: note: declared here
   47 | ll fatt (ll n, ll p) {
      |    ^~~~
a.cc:57:53: error: too few arguments to function 'long long int fatt(long long int, long long int)'
   57 |     return (fatt(n) % p) * inverse((fatt(n-k) * fatt(k)), p);
      |                                                 ~~~~^~~
a.cc:47:4: note: declared here
   47 | ll fatt (ll n, ll p) {
      |    ^~~~
a.cc:57:28: error: 'inverse' was not declared in this scope
   57 |     return (fatt(n) % p) * inverse((fatt(n-k) * fatt(k)), p);
      |                            ^~~~~~~
a.cc: In function 'int main()':
a.cc:78:22: error: too few arguments to function 'long long int bin(long long int, long long int, long long int)'
   78 |         ll res = (bin(K-1,i-1) % p) * (bin(N-K+1, i) % p);
      |                   ~~~^~~~~~~~~
a.cc:56:4: note: declared here
   56 | ll bin (ll n, ll k, ll p) {
      |    ^~~
a.cc:78:43: error: too few arguments to function 'long long int bin(long long int, long long int, long long int)'
   78 |         ll res = (bin(K-1,i-1) % p) * (bin(N-K+1, i) % p);
      |                                        ~~~^~~~~~~~~~
a.cc:56:4: note: declared here
   56 | ll bin (ll n, ll k, ll p) {
      |    ^~~
a.cc: In function 'long long int powermodp(long long int, long long int, long long int)':
a.cc:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^