#include<bits/stdc++.h>
using namespace std;
const int N=2010,mod=998244353,M=N;
typedef long long ll;
ll fastpow(ll a,int b)
{
	ll s=1;
	for(;b;b>>=1,a=a*a%mod)
		if(b&1) s=s*a%mod;
	return s;
}
ll fac[N],ifac[N],inv[N];
int n,p1,p2;
ll g1[M][N],g2[M][N],f[M][N],h[M][N];
void init(int n)
{
	fac[0]=ifac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mod;
	ifac[n]=fastpow(fac[n],mod-2);
	for(int i=n-1;i;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
	for(int i=1;i<=n;i++) inv[i]=fac[i-1]*ifac[i]%mod;
}
ll s[N];
void exp(ll *a)
{
	for(int i=0;i<=n;i++) s[i]=(i==0);
	for(int i=1;i<=n;i++) a[i]=a[i]*i%mod;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<i;j++)
			s[i]=(s[i]+s[j]*a[i-j])%mod;
		s[i]=s[i]*inv[i]%mod;
	}
	for(int i=0;i<=n;i++) a[i]=s[i];
}
int main()
{
	ll p1,p2;
	scanf("%d%lld%lld",&n,&p1,&p2);
	p1=p1*fastpow(p2,mod-2)%mod;
	p2=(mod+1-p1)%mod;
	if(n==1) return puts("0"),0;
	init(n+1);
	f[0][1]=h[0][0]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<n;j++) h[i][j]=(f[i-1][j]*p1+(i==1?0:f[i-2][j]*p2))%mod;
		exp(h[i]);
		for(int j=1;j<=n;j++) f[i][j]=h[i][j-1];
	}
	for(int i=0;i<=n;i++)
		for(int j=1;j<n;j++)
			g1[i][j]=(f[i][j]-(i==0?0:f[i-1][j])+mod)%mod;
	for(int i=1;i<=n;i++)
		for(int j=1;j<n;j++)
			g2[i][j]=(g1[i-1][j]*p1+(i==1?0:g1[i-2][j]*p2))%mod;
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		ll cur=h[i][n-1]-h[i-1][n-1]+mod;
		for(int j=1;j<n;j++)
			cur=(cur+(mod-g2[i][j])*h[i-1][n-j-1])%mod;
		cur=cur*fac[n]%mod;
		ans=(ans+cur*i*2)%mod;
	}
	for(int i=0;i<=n;i++)
		for(int j=1;j<n;j++)
		{
			ll s1=g1[i][j]*g1[i][n-j]%mod*inv[2]%mod*fac[n]%mod,
				s2=g1[i][j]*g1[i+1][n-j]%mod*fac[n]%mod;
			ans=(ans+(p1*(2*i+1)+p2*(2*i+2))%mod*s1+p2*(2*i+3)%mod*s2)%mod;
		}
	printf("%lld\n",ans*fastpow(n,(mod-1)-(n-2))%mod);
}