#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
#define SIZE 500000
ll inv[SIZE + 1];
ll kai[SIZE + 1];
ll invkai[SIZE + 1];
void invinit()
{
	inv[1] = 1;
	for (int i = 2; i <= SIZE; i++)
	{
		inv[i] = mod - (mod / i)*inv[mod%i] % mod;
	}
	kai[0] = invkai[0] = 1;
	for (int i = 1; i <= SIZE; i++)
	{
		kai[i] = kai[i - 1] * i%mod;
		invkai[i] = invkai[i - 1] * inv[i] % mod;
	}
}
ll com(ll a, ll b)
{
	if (b < 0 || a < b)return 0;
	return (invkai[b] * invkai[a - b]) % mod*kai[a] % mod;
}
ll po(ll a, ll b)
{
	if (b == 0)return 1;
	ll z = po(a, b / 2);
	z = z*z%mod;
	if (b % 2 == 1)z = z*a%mod;
	return z;
}
int main()
{
	invinit();
	int n, a, b, c;
	scanf("%d%d%d%d", &n, &a, &b, &c);
	ll ka = a * inv[a + b] % mod, kb = b * inv[a + b] % mod;
	ll r = 0;
	for (int i = 0; i <= n - 1; i++)
	{
		ll sa = com(n - 1 + i, n - 1)*ka%mod*po(ka, n - 1) % mod*po(kb, i);
		ll sb = com(n - 1 + i, n - 1)*kb%mod*po(kb, n - 1) % mod*po(ka, i);
		r = (r + (sa + sb) % mod*(n + i)) % mod;
	}
	printf("%lld\n", r * 100 % mod*inv[a + b] % mod);
}