#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long pa, pb, k;
long long inva, invb, invp;
long long f[1005][1005];
long long inv(int x) {
  if (x == 1) return 1;
  return ((-mod / x) * inv(mod % x) % mod + mod) % mod;
}
long long solve(int sa, int i) {
  if (i >= k) return i;
  if (f[sa][i] > 0) return f[sa][i];
  if (sa + i >= k) return ((sa + i) % mod * pb % mod + pa) % mod * invb % mod;
  f[sa][i] = (pa * invp % mod * solve(sa + 1, i) % mod +
              pb * invp % mod * solve(sa, i + sa)) %
             mod;
  return f[sa][i];
}
int main() {
  scanf("%lld %lld %lld", &k, &pa, &pb);
  inva = inv(pa);
  invb = inv(pb);
  invp = inv((pa + pb) % mod);
  printf("%lld\n", solve(1, 0));
}
