#include <bits/stdc++.h>
using namespace std;
#include <atcoder/convolution>
using mint = atcoder::modint998244353;
#define rep(i, a, b) for (int i = a; i < b; i++)

vector<mint> solve_fast_1(int N, int P, int Q){
    vector<mint> ans(N);
    vector dp(P + 1, vector<mint>(Q + 1));
    dp[0][0] = 1;
    rep(rp, 0, N){
        rep(i, 0, P + 1) rep(j, 0, Q + 1){
            if (i * Q < j * P) dp[i][j] = 0;
        }
        ans[rp] = dp[P][Q];
        rep(i, 0, P + 1) rep(j, 0, Q) dp[i][j + 1] += dp[i][j];
        rep(i, 0, P) rep(j, 0, Q + 1) dp[i + 1][j] += dp[i][j];
    }
    return ans;
}


int main(){
	int N, P, Q;
	cin >> N >> P >> Q;
	N++;
	auto ans = solve_fast_1(N, P, Q);
	for (int i = 1; i < N; i++) cout << ans[i].val() << "\n";
}