#include <bits/stdc++.h>
using namespace std;
int k;
long long a, b, mod = 1e9 + 7, dp[1010][1010];
long long step(long long base, long long pw) {
  long long ret = 1;
  for (int i = 0; i <= 31; i++) {
    if (pw & (1 << i)) ret = (ret * base) % mod;
    base = (base * base) % mod;
  }
  return ret;
}
long long inv(long long x) { return step(x, mod - 2); }
long long go(int cnt, int cntab) {
  if (cntab >= k) return cntab;
  if (cnt == k) {
    long long pom = (a * inv(b)) % mod;
    return cnt + pom + cntab;
  }
  if (dp[cnt][cntab] != -1) return dp[cnt][cntab];
  dp[cnt][cntab] = (a * go(cnt + 1, cntab) + b * go(cnt, cntab + cnt)) % mod;
  return dp[cnt][cntab];
}
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%d %lld %lld", &k, &a, &b);
  long long pi = inv(a + b);
  a = (a * pi) % mod;
  b = (b * pi) % mod;
  printf("%lld\n", go(1, 0));
  return 0;
}
