#include <bits/stdc++.h>
using namespace std;
const int N = 2010, mod = 998244353;
int n, a, b;
int qp(int x, int k) {
  int res = 1;
  for (; k; k >>= 1, x = 1ll * x * x % mod)
    if (k & 1) res = 1ll * res * x % mod;
  return res;
}
int f[N], dp[N][N], g[N];
int pw[N], qw[N];
int main() {
  scanf("%d", &n);
  scanf("%d%d", &a, &b);
  int p = 1ll * a * qp(b, mod - 2) % mod, q = (1 - p + mod) % mod;
  pw[0] = qw[0] = 1;
  for (int i = 1; i <= n; i++)
    pw[i] = 1ll * pw[i - 1] * p % mod, qw[i] = 1ll * qw[i - 1] * q % mod;
  for (int i = 0; i <= n; i++) {
    dp[i][0] = 1;
    for (int j = 1; j <= i; j++)
      dp[i][j] =
          (1ll * dp[i - 1][j - 1] * pw[i - j] + 1ll * dp[i - 1][j] * qw[j]) %
          mod;
  }
  for (int i = 1; i <= n; i++) {
    f[i] = 1;
    for (int j = 1; j < i; j++)
      f[i] = (f[i] + mod - 1ll * dp[i][j] * f[j] % mod) % mod;
  }
  for (int i = 2; i <= n; i++) {
    g[i] = i * (i - 1) / 2;
    for (int j = 1; j < i; j++)
      g[i] = (g[i] +
              1ll * f[j] * dp[i][j] % mod *
                  (1ll * g[j] + g[i - j] - (i - j) * (i - j - 1) / 2 + mod)) %
             mod;
    g[i] = 1ll * g[i] * qp(1 - f[i] + mod, mod - 2) % mod;
  }
  printf("%d\n", g[n]);
  return 0;
}
