#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
const long long MOD = 1000 * 1000 * 1000LL + 7;
long long d[N][N];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long double pa, pb;
  long long fpa, fpb, ffpb = 1, ans = 0, k, t1, t2;
  cin >> k >> t1 >> t2;
  fpa = t1;
  fpb = t2;
  long long temp = t1 + t2, t = 0;
  for (int i = 0; i < 31; i++) {
    if (((1 << i) & (MOD - 2)) != 0) {
      fpa *= temp, fpb *= temp;
      fpa %= MOD, fpb %= MOD;
    }
    temp *= temp;
    temp %= MOD;
  }
  temp = fpb;
  for (int i = 0; i < 31; i++) {
    if (((1 << i) & (MOD - 2)) != 0) ffpb *= temp, ffpb %= MOD;
    temp *= temp;
    temp %= MOD;
  }
  d[1][0] = 1;
  for (int i = 1; i < k; i++) {
    for (int j = 0; j < k; j++) {
      d[i + 1][j] += d[i][j] * fpa;
      d[i + 1][j] %= MOD;
      if (i + j >= k)
        ans += ((d[i][j] * fpb) % MOD) * (i + j), ans %= MOD;
      else
        d[i][j + i] += d[i][j] * fpb, d[i][j + i] %= MOD;
    }
  }
  for (long long j = 0; j < k; j++) {
    ans += (((((ffpb * fpb) % MOD) * d[k][j]) % MOD) *
            ((fpa * ffpb + k + j) % MOD)) %
           MOD;
    ans %= MOD;
  }
  cout << ans << endl;
  return 0;
}
