#include <bits/stdc++.h>
using namespace std;
const int N = 4010;
const int MOD = 1e9 + 7;
void mult(int &a, int b) { a = (1ll * a * b) % MOD; }
int product(int a, int b) { return (1ll * a * b) % MOD; }
void add(int &a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
int sum(int a, int b) { return (a + b) % MOD; }
int power(int b, int p) {
  int res = 1;
  while (p) {
    if (p & 1) {
      mult(res, b);
    }
    mult(b, b);
    p /= 2;
  }
  return res;
}
int k, pa, push_back, ipb, ipab;
int p1, p2;
int dp[N][N];
int solve(int x, int y) {
  if (dp[x][y] != -1) return dp[x][y];
  if (y >= k) {
    return dp[x][y] = y;
  }
  if (x > k) {
    return dp[x][y] = sum(sum(x, y), product(pa, ipb));
  }
  if (x == 0) {
    return dp[x][y] = solve(x + 1, y);
  }
  dp[x][y] = 0;
  add(dp[x][y], product(p1, solve(x + 1, y)));
  add(dp[x][y], product(p2, solve(x, y + x)));
  return dp[x][y];
}
int main() {
  cin >> k >> pa >> push_back;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) dp[i][j] = -1;
  }
  ipb = power(push_back, MOD - 2);
  ipab = power(pa + push_back, MOD - 2);
  p1 = product(pa, ipab);
  p2 = product(push_back, ipab);
  cout << solve(0, 0);
  return 0;
}
