#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 200'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}

// f = (1+z)^a (1-z)^b
//   f' = a f/(1+z) - b f/(1-z)
//   (1-z^2) f' = (a(1-z) - b(1+z)) f
vector<Mint> expand(int len, Mint a, Mint b) {
  vector<Mint> fs(len);
  fs[0] = 1;
  fs[1] = a - b;
  for (int i = 1; i < len - 1; ++i) {
    fs[i + 1] = inv[i + 1] * ((a - b) * fs[i] + (-a - b + (i - 1)) * fs[i - 1]);
  }
  return fs;
}


/*
  mod (x[0]^2, ..., x[E-1]^2)
  ans(t)
  = [x^X] \prod[0<=p<M] (1 + t x^p) / (1-t^2)
  = (1/2^E) \sum[0<=q<2^E] (-1)^#(X&q) \prod[0<=p<M] (1 + (-1)^#(p&q) t)
  
  M = 1001001001(2)
      0*********
      1000******
      1001000***
      1001001000
  classify q by: \sum[0<=p<M] (-1)^#(p&q)
  depends on bsf(q) and (-1)^#(M&q)
*/
vector<Mint> solve(int N, Int M, Int X) {
  int E;
  for (E = 0; !(M <= 1LL << E && X < 1LL << E); ++E) {}
  
#ifdef LOCAL
cerr<<"E = "<<E<<", M = "<<M<<", X = "<<X<<endl;
map<Int,Int>brt;
for(Int q=0;q<1LL<<E;++q){
 Int dif=0;
 for(Int p=0;p<M;++p)dif+=(__builtin_parity(p&q)?-1:+1);
 // cerr<<"  "<<q<<": "<<dif<<" "<<(__builtin_parity(X&q)?-1:+1)<<endl;
 brt[dif]+=(__builtin_parity(X&q)?-1:+1);
}
cerr<<"  brt = ";pv(brt.begin(),brt.end());
#endif
  
  vector<Mint> ans(N, 0);
  auto add = [&](Int dif, Int val) -> void {
#ifdef LOCAL
cerr<<"  add "<<dif<<" "<<val<<endl;
brt[dif]-=val;
#endif
    // (1+t)^num0 (1-t)^num0 / (1-t^2)^M
    const Int num0 = (M + dif) / 2;
    const Int num1 = (M - dif) / 2;
    const auto res = expand(N, num0 - M, num1 - M);
    for (int i = 0; i < N; ++i) {
      ans[i] += val * res[i];
    }
  };
  
  {
    // q = 0
    add(M, +1);
    Int crt[2] = {1, 0};
    Int m = M & 1LL << E;
    for (int e = E; --e >= 0; ) {
      // bsf(q) = e
      Int dif;
      if (M >> e & 1) {
        const Int mm = m + (1LL << e);
        dif = (mm - m) - (M - mm);
        m = mm;
      } else {
        dif = M - m;
      }
      const int sigX = (X >> e & 1) ? -1 : +1;
      add(+dif, sigX * crt[0]);
      add(-dif, sigX * crt[1]);
      Int nxt[2] = {};
      for (int s = 0; s < 2; ++s) {
        nxt[s] += crt[s];
        nxt[s ^ (M >> e & 1)] += sigX * crt[s];
      }
      memcpy(crt, nxt, sizeof(nxt));
    }
  }
#ifdef LOCAL
for(const auto&kv:brt)assert(kv.second==0);
#endif
  
  const Mint invTwo = Mint(2).pow(-E);
  for (int i = 0; i < N; ++i) {
    ans[i] *= invTwo;
  }
  return ans;
}

int main() {
  prepare();
  
#ifdef LOCAL
  for (Int m = 0; m <= 64; ++m) for (Int x = 0; x <= 64; ++x) {
    // solve(10, m, x);
  }
#endif
  
  int N;
  Int M, X;
  for (; ~scanf("%d%lld%lld", &N, &M, &X); ) {
    ++N;
    ++M;
    const auto ans = solve(N, M, X);
    for (int i = 1; i < N; ++i) {
      printf("%u\n", ans[i].x);
    }
  }
  return 0;
}