#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,p,q;
const int mod=1e9+7;
int dp[500005];
int coef[500005];
int qkp(int b,int p){
    int r=1;
    while(p){
        if(p&1)(r*=b)%=mod;
        p/=2;
        (b*=b)%=mod;
    }
    return r;
}
signed main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>n>>p>>q;
    p=q-p+mod,p%=mod;
    memset(dp,-1,sizeof(dp));
    dp[n]=1;
    dp[0]=0;
    coef[1]=(q-p+mod)*qkp(q,mod-2)%mod;
    int d=p*qkp(q,mod-2)%mod;
    for(int i=2;i<n;i++){
        coef[i]=(q-p+mod)*qkp(q,mod-2)%mod*qkp(mod+1-d*coef[i-1]%mod+mod,mod-2)%mod;
        //dp[i]=coef[i]*dp[i+1]
        //dp[i]*(1-(p/q)*coef[i-1])=dp[i+1]*(q-p)/q
        //dp[1]=dp[2]*((q-p)/q)
        //dp[2]=dp[1]*(p/q)+dp[3]*((q-p)/q)
        //dp[3]
        //dp[i]=dp[i-1]*((q-p)/q)+dp[i+1]*p/q
    }
    for(int i=n-1;i>=1;i--){
        dp[i]=dp[i+1]*coef[i]%mod;
    }
    for(int i=1;i<=n;i++)cout<<dp[i]<<" ";
    return 0;
}