#include <bits/stdc++.h>
#pragma GCC optimize("-O2")
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void Out(int x) {
  if (x > 9) Out(x / 10);
  putchar(x % 10 + '0');
}
long long qpow(long long x, long long y, long long P) {
  long long re = 1;
  while (y) {
    if (y & 1) re = re * x % P;
    x = x * x % P;
    y >>= 1;
  }
  return re;
}
const long long P = 998244353;
const int N = 2050;
int n;
long long a, b;
long long win[N], los[N], s[N], ans[N];
long long cp[N][N];
int main() {
  scanf("%d%lld%lld", &n, &a, &b);
  win[0] = los[0] = 1;
  win[1] = a * qpow(b, P - 2, P) % P;
  los[1] = (1 + P - win[1]) % P;
  for (int i = 2; i <= n; ++i) {
    win[i] = win[i - 1] * win[1] % P;
    los[i] = los[i - 1] * los[1] % P;
  }
  for (int k = 0; k <= n; ++k) {
    cp[k][0] = 1;
    for (int i = 1; i <= k; ++i) {
      cp[k][i] = (cp[k - 1][i] * los[i] + cp[k - 1][i - 1] * win[k - i]) % P;
    }
  }
  s[1] = 1;
  for (int k = 2; k <= n; ++k) {
    s[k] = 1;
    for (int i = 1; i < k; ++i) {
      s[k] += P - s[i] * cp[k][i] % P;
      s[k] -= s[k] >= P ? P : 0;
    }
  }
  for (long long i = 2; i <= n; i++) {
    long long tmp = 0;
    for (long long j = 1; j < i; j++)
      tmp = (tmp + s[j] * cp[i][j] % P *
                       (ans[j] + ans[i - j] + j * (j - 1) / 2 + j * (i - j))) %
            P;
    tmp = (tmp + s[i] * (i * (i - 1) / 2)) % P;
    ans[i] = tmp * qpow(1 - s[i], P - 2, P) % P;
  }
  ans[n] = (ans[n] % P + P) % P;
  printf("%lld\n", ans[n]);
  return 0;
}
