#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
const int MOD = 1e9 + 7;
int mul(int a, int b) { return a * 1LL * b % MOD; }
int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}
int p(int a, int b) {
  int res = 1;
  while (b > 0) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b /= 2;
  }
  return res;
}
int inv(int a) { return p(a, MOD - 2); }
bool seen[N][N];
int dp[N][N];
int k, pa, pb, sum;
int solve(int a, int b) {
  if (a + b >= k) return add(a + b, mul(pa, inv(pb)));
  if (seen[a][b]) return dp[a][b];
  seen[a][b] = 1;
  dp[a][b] = add(mul(pa, solve(a + 1, b)), mul(pb, solve(a, a + b)));
  return dp[a][b];
}
int main() {
  scanf("%d %d %d", &k, &pa, &pb);
  sum = pa + pb;
  pa = mul(pa, inv(sum));
  pb = mul(pb, inv(sum));
  printf("%d", solve(1, 0));
  return 0;
}
