#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;} return false;}
template <typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;} return false;}

ll mod=10007;
int MAX=mod;
vector<ll> inv(MAX);
void init(){
  inv[1]=1;
  rep(i,2,MAX){
    inv[i]=mod-(mod/i)*inv[mod%i]%mod;
  }
  return;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int k,s,n; cin >> k >> s >> n;
  init();
  vector<int> F(k+1);
  F[0]=F[1]=1;
  rep(i,2,k+1) F[i]=(F[i-1]+F[i-2])%mod;
  vector<int> ans(n+1);
  ans[1]=s;
  rep(i,2,n+1){
    for(int j=i-1;j>=max(0,i-k-1);j--){
      ans[i]+=ans[j]*inv[F[i-1-j]];
      ans[i]%=mod;
    }
  }
  rep(i,0,n+1) cout << ans[i] << " ";
  cout << '\n';
  cout << ans[n] << "\n";
}