#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e3 + 5;
long long k, u, v, a, b, c, f[N][N];
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
long long qm(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long inv(long long a) { return qm(a, mod - 2); }
int main() {
  k = read();
  u = read();
  v = read();
  a = u * inv(u + v) % mod;
  b = (1 - a + mod) % mod;
  c = a * inv(b) % mod;
  for (int i = k; i >= 1; i--)
    for (int j = k - 1; j >= 0; j--)
      f[i][j] = i + j >= k
                    ? i + j + c
                    : (a * f[i + 1][j] % mod + b * f[i][i + j] % mod) % mod;
  printf("%lld", f[1][0]);
  return 0;
}
