#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
template <typename T>
inline void read(T &AKNOI) {
  T x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  AKNOI = flag * x;
}
template <typename T>
inline void cmax(T &x, T y) {
  if (x < y) x = y;
}
namespace ModCalculator {
const int MOD = 998244353;
inline void Inc(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
inline void Dec(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
inline int Add(int x, int y) {
  Inc(x, y);
  return x;
}
inline int Sub(int x, int y) {
  Dec(x, y);
  return x;
}
inline int Mul(int x, int y) { return 1LL * x * y % MOD; }
inline int ksm(int x, int k) {
  int ret = 1;
  for (; k; k >>= 1) {
    if (k & 1) ret = Mul(ret, x);
    x = Mul(x, x);
  }
  return ret;
}
inline int Inv(int x) { return ksm(x, MOD - 2); }
}  // namespace ModCalculator
using namespace ModCalculator;
int n, a, b, p, q, pw[N], qw[N];
int c2[N], h[N][N], g[N], f[N];
void init() {
  read(n);
  read(a);
  read(b);
  p = Mul(a, Inv(b));
  q = Sub(1, p);
  pw[0] = qw[0] = 1;
  for (int i = 1; i <= n; ++i) {
    pw[i] = Mul(pw[i - 1], p);
    qw[i] = Mul(qw[i - 1], q);
  }
}
void solve() {
  for (int i = 2; i <= n; ++i) {
    c2[i] = (1LL * i * (i - 1) / 2) % MOD;
  }
  for (int i = 0; i <= n; ++i) {
    h[i][0] = h[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      h[i][j] = Add(Mul(h[i - 1][j], qw[j]), Mul(h[i - 1][j - 1], pw[i - j]));
    }
  }
  for (int i = 1; i <= n; ++i) {
    g[i] = 1;
    for (int j = 1; j < i; ++j) {
      Dec(g[i], Mul(g[j], h[i][j]));
    }
  }
  f[1] = 0;
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j < i; ++j) {
      int tmp = Add(Add(f[j], f[i - j]), Add(c2[j], Mul(j, i - j)));
      Inc(f[i], Mul(Mul(g[j], h[i][j]), tmp));
    }
    f[i] = Mul(Inv(Sub(1, g[i])), Add(Mul(g[i], c2[i]), f[i]));
  }
  printf("%d\n", f[n]);
}
int main() {
  init();
  solve();
  return 0;
}
