#include <bits/stdc++.h>
using namespace std;
const long long N = 2009, mod = 1e9 + 7;
long long k, pa, pb, f[N][N], A, B, C;
inline long long poww(long long x, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod;
    k >>= 1;
  }
  return res;
}
signed main() {
  scanf("%lld%lld%lld", &k, &pa, &pb);
  A = 1ll * pa * poww(pb + pa, mod - 2) % mod;
  B = 1ll * pb * poww(pa + pb, mod - 2) % mod;
  C = 1ll * pa * poww(pb, mod - 2) % mod;
  for (long long i = k; i >= 0; i--)
    for (long long j = k; j >= 0; j--)
      f[i][j] =
          (i + j >= k
               ? (i + j + C) % mod
               : (1ll * A * f[i + 1][j] % mod + 1ll * B * f[i][i + j] % mod) %
                     mod) %
          mod;
  printf("%lld", f[1][0]);
  return 0;
}
