#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int const N = 3000 + 20, mod = 1e9 + 7;
int n, pa, pb, ans, dp[N][N], dp2[N][N], res[N][N], dd;
inline int pw(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return res;
}
inline int inv(int x) { return pw(x, mod - 2); }
inline void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  if (a < 0) a += mod;
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> pa >> pb;
  for (int i = n; i >= 0; i--)
    for (int j = n; j; j--)
      dp[i][j] =
          (i + j >= n ? i + j + 1ll * pa * inv(pb)
                      : 1ll * pa * inv(pa + pb) % mod * dp[i][j + 1] +
                            1ll * pb * inv(pa + pb) % mod * dp[i + j][j]) %
          mod;
  cout << dp[0][1] << '\n';
}
