#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  puts("");
}
const long long N = 2010, mod = 1e9 + 7;
long long f[N][N];
long long n, a, b, add_a, add_b;
long long ppow(long long x, long long k) {
  long long ans = 1;
  while (k) {
    if (k & 1) ans = ans * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return ans;
}
void add(long long &x, long long y) { x = (x + y) % mod; }
int main() {
  n = read();
  a = read();
  b = read();
  add_a = a * ppow(a + b, mod - 2) % mod;
  add_b = 1 + mod - add_a;
  long long ans = 0, calc = a * ppow(b, mod - 2) % mod;
  for (int i = n; i >= 1; --i)
    for (int j = n - 1; j >= 0; --j) {
      if (i + j >= n)
        f[i][j] = (i + j + calc) % mod;
      else
        f[i][j] = (add_a * f[i + 1][j] + add_b * f[i][j + i]) % mod;
    }
  writeln(f[1][0]);
}
