#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, p, q;
int pow_p[2005], pow_q[2005], f[2005], ans[2005];
int C[2005][2005];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') f = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  return x * f;
}
int power(int a, int k) {
  int ret = 1;
  for (; k; k >>= 1, a = 1ll * a * a % mod)
    if (k & 1) ret = 1ll * ret * a % mod;
  return ret;
}
int main() {
  n = read();
  p = 1ll * read() * power(read(), mod - 2) % mod;
  q = (1 - p + mod) % mod;
  pow_p[0] = 1;
  for (int i = 1; i <= n; i++) pow_p[i] = 1ll * pow_p[i - 1] * p % mod;
  pow_q[0] = 1;
  for (int i = 1; i <= n; i++) pow_q[i] = 1ll * pow_q[i - 1] * q % mod;
  for (int i = 0; i <= n; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++)
      C[i][j] = (1ll * C[i - 1][j - 1] * pow_p[i - j] +
                 1ll * C[i - 1][j] * pow_q[j]) %
                mod;
  }
  f[1] = 1;
  for (int i = 2; i <= n; i++) {
    f[i] = 1;
    for (int j = 1; j < i; j++) f[i] = (f[i] - 1ll * f[j] * C[i][j]) % mod;
  }
  ans[0] = ans[1] = 0;
  for (int i = 2; i <= n; i++) {
    int res = 0;
    for (int j = 1; j < i; j++)
      res =
          (res + 1ll * f[j] * C[i][j] % mod *
                     ((i - j) * j + (j * (j - 1) >> 1) + ans[j] + ans[i - j])) %
          mod;
    res = (res + 1ll * f[i] * (i * (i - 1) >> 1)) % mod;
    ans[i] = 1ll * res * power(1 - f[i], mod - 2) % mod;
  }
  printf("%d\n", (ans[n] + mod) % mod);
  return 0;
}
