#include<bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

using namespace std;

const int P=1E9+7;
const int MAXN=2E5+10;

template<typename T1,typename T2>
	void Inc(T1 &a,T2 b){a+=b;if(a>=P) a-=P;}

template<typename T1,typename T2>
	void Dec(T1 &a,T2 b){a-=b;if(a<0) a+=P;}

template<typename T1,typename T2>
	T1 Add(T1 a,T2 b){a+=b;return a>=P?a-P:a;}

template<typename T1,typename T2>
	T1 Sub(T1 a,T2 b){a-=b;return a<0?a+P:a;}

ll ksm(ll a,ll b)
{
	ll ret=1;
	for(;b;b>>=1,(a*=a)%=P)
		if(b&1)
			(ret*=a)%=P;
	return ret;
}

ll fac[MAXN],ifac[MAXN];

ll C(int n,int m)
{
	if(n<m||n<0||m<0)
		return 0;
	return fac[n]*ifac[m]%P*ifac[n-m]%P;
}

int main()
{
	int n,a,b;
	scanf("%d%d%d%*d",&n,&a,&b);
	int c=a+b;
	a=a*ksm(c,P-2)%P;
	b=b*ksm(c,P-2)%P;
	fac[0]=ifac[0]=1;
	for(int i=1;i<MAXN;i++)
		fac[i]=fac[i-1]*i%P;
	ifac[MAXN-1]=ksm(fac[MAXN-1],P-2);
	for(int i=MAXN-2;i;i--)
		ifac[i]=ifac[i+1]*(i+1)%P;
	ll Ans=0;
	for(int i=0;i<n;i++)
		Inc(Ans,ksm(a,n)*ksm(b,i)%P*(i+n)%P*C(n+i-1,i)%P);
	for(int i=0;i<n;i++)
		Inc(Ans,ksm(b,n)*ksm(a,i)%P*(i+n)%P*C(n+i-1,i)%P);
	printf("%lld\n",Ans*100%P*ksm(c,P-2)%P);
}
