#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const long long mod = 998244353;
long long KSM(long long x, long long k) {
  long long s = 1;
  while (k) {
    if (k & 1) s = s * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return s;
}
long long g[N], c[N][N], f[N], mp[N], mq[N];
int n;
long long Inv(long long x) { return KSM(x, mod - 2); }
int main() {
  long long a, b, p, q;
  scanf("%d%lld%lld", &n, &a, &b);
  p = a * Inv(b) % mod;
  q = (1 - p + mod) % mod;
  mp[0] = mq[0] = 1;
  for (int i = 1; i <= n; i++)
    mp[i] = mp[i - 1] * p % mod, mq[i] = mq[i - 1] * q % mod;
  c[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] =
          (c[i - 1][j] * mq[j] % mod + c[i - 1][j - 1] * mp[i - j] % mod) % mod;
  }
  g[1] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j < i; j++) g[i] = (g[i] + g[j] * c[i][j] % mod) % mod;
    g[i] = (1 - g[i] + mod) % mod;
  }
  f[1] = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j < i; j++) {
      long long d = 0;
      d = (d + f[j] + f[i - j]) % mod;
      d = (d + 1ll * j * (j - 1) / 2 % mod + 1ll * j * (i - j) % mod) % mod;
      d = d * g[j] % mod * c[i][j] % mod;
      f[i] = (f[i] + d) % mod;
    }
    f[i] =
        (f[i] + 1ll * i * (i - 1) / 2 % mod * g[i] % mod * c[i][i] % mod) % mod;
    f[i] = (f[i] * Inv((1 - g[i] * c[i][i] % mod + mod) % mod) % mod) % mod;
  }
  printf("%lld\n", f[n]);
  return 0;
}
