#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long gcdExtended(long long a, long long b, long long *x, long long *y);
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    return 0;
  else {
    long long res = (x % m + m) % m;
    return res;
  }
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int K;
long long dp[1050][1050];
long long getdp(int a, int b) {
  if (b >= K) return b;
  return dp[a][b];
}
int main() {
  int Pa, Pb, i, j;
  scanf("%d %d %d", &K, &Pa, &Pb);
  for (i = 0; i < K; i++) {
    dp[K][i] = (i + K + Pa * modInverse(Pb, MOD)) % MOD;
  }
  for (i = K - 1; i >= 1; i--) {
    for (j = K - 1; j >= 0; j--) {
      dp[i][j] = Pa * getdp(i + 1, j) + Pb * getdp(i, i + j);
      dp[i][j] %= MOD;
      dp[i][j] = (dp[i][j] * modInverse(Pa + Pb, MOD)) % MOD;
    }
  }
  return !printf("%lld\n", dp[1][0]);
}
