#include <bits/stdc++.h>
using namespace std;
long long k, a, b;
int M = 1e9 + 7;
int d[2001][2001];
void exgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, y, x);
    y -= a / b * x;
  }
}
int inv(int t, int m) {
  int x, y;
  exgcd(t, m, x, y);
  return (x + m) % m;
}
int main() {
  cin >> k >> a >> b;
  int ab = inv(a + b, M);
  for (int i = 1999; i >= 1; i--)
    for (int j = 1999; j >= 0; j--) {
      d[i][j] = (j >= k) ? j
                : (i + j >= k)
                    ? (a * inv(b, M) + i + j) % M
                    : (a * ab % M * d[i + 1][j] + b * ab % M * d[i][i + j]) % M;
    }
  cout << d[1][0] << endl;
  return 0;
}
