#include <bits/stdc++.h>
const int N = 3005, mu = 998244353;
int h[N][N], g[N], f[N], n, a, p, b;
int ksm(int x, int y) {
  int ans = 1;
  for (; y; y >>= 1, x = x * 1ll * x % mu)
    if (y & 1) ans = ans * 1ll * x % mu;
  return ans;
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  p = a * 1ll * ksm(b, mu - 2) % mu;
  h[1][0] = h[1][1] = 1;
  for (int i = 2; i <= n; i++) {
    h[i][0] = 1;
    for (int j = 1; j <= i; j++)
      h[i][j] = (1ll * ksm(mu + 1 - p, j) * h[i - 1][j] +
                 1ll * ksm(p, i - j) * h[i - 1][j - 1]) %
                mu;
  }
  for (int i = 1; i <= n; i++) {
    g[i] = 1;
    for (int j = 1; j < i; j++) g[i] = (g[i] - 1ll * g[j] * h[i][j]) % mu;
    g[i] = (g[i] + mu) % mu;
  }
  for (int i = 2; i <= n; i++) {
    f[i] = i * 1ll * (i - 1) / 2 % mu * g[i] % mu * h[i][i] % mu;
    for (int j = 1; j < i; j++)
      f[i] = (f[i] + (f[j] + f[i - j] + 1ll * j * (j - 1) / 2 + j * (i - j)) %
                         mu * g[j] % mu * h[i][j] % mu) %
             mu;
    f[i] = 1ll * f[i] * ksm(mu + 1 - g[i] * 1ll * h[i][i] % mu, mu - 2) % mu;
  }
  printf("%d\n", f[n]);
}
