#include <bits/stdc++.h>
clock_t t = clock();
namespace my_std {
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
inline T rnd(T l, T r) {
  return uniform_int_distribution<T>(l, r)(rng);
}
template <typename T>
inline bool chkmax(T& x, T y) {
  return x < y ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmin(T& x, T y) {
  return x > y ? x = y, 1 : 0;
}
template <typename T>
inline void read(T& t) {
  t = 0;
  char f = 0, ch = getchar();
  double d = 0.1;
  while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
  while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();
  if (ch == '.') {
    ch = getchar();
    while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
  }
  t = (f ? -t : t);
}
template <typename T, typename... Args>
inline void read(T& t, Args&... args) {
  read(t);
  read(args...);
}
char __sr[1 << 21], __z[20];
int __C = -1, __zz = 0;
inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; }
inline void print(register int x) {
  if (__C > 1 << 20) Ot();
  if (x < 0) __sr[++__C] = '-', x = -x;
  while (__z[++__zz] = x % 10 + 48, x /= 10)
    ;
  while (__sr[++__C] = __z[__zz], --__zz)
    ;
  __sr[++__C] = '\n';
}
void file() {}
inline void chktime() {}
long long ksm(long long x, int y) {
  long long ret = 1;
  for (; y; y >>= 1, x = x * x % 998244353ll)
    if (y & 1) ret = ret * x % 998244353ll;
  return ret;
}
long long inv(long long x) { return ksm(x, 998244353ll - 2); }
}  // namespace my_std
using namespace my_std;
int n;
long long _a, _b, p, q;
long long pw1[4040], pw2[4040];
long long f[4040], g[4040], dp[4040][4040];
int main() {
  file();
  read(n, _a, _b);
  p = _a * inv(_b) % 998244353ll;
  q = 998244353ll + 1 - p;
  pw1[0] = pw2[0] = 1;
  for (int i = (1); i <= (n); i++)
    pw1[i] = pw1[i - 1] * p % 998244353ll,
    pw2[i] = pw2[i - 1] * q % 998244353ll;
  dp[0][0] = 1;
  for (int i = (1); i <= (n); i++)
    for (int j = (0); j <= (i); j++)
      dp[i][j] = (dp[i - 1][j] * pw2[j] % 998244353ll +
                  dp[i - 1][j - 1] * pw1[i - j] % 998244353ll) %
                 998244353ll;
  for (int i = (1); i <= (n); i++) g[i] = 1;
  for (int i = (2); i <= (n); i++)
    for (int j = (1); j <= (i - 1); j++)
      g[i] = (998244353ll + g[i] - dp[i][j] * g[j] % 998244353ll) % 998244353ll;
  f[1] = 0;
  for (int i = (2); i <= (n); i++) {
    long long sum = 0;
    for (int j = (1); j <= (i - 1); j++)
      (sum += dp[i][j] * g[j] % 998244353ll *
              (1ll * j * (i - j) % 998244353ll +
               (1ll * j * (j - 1) / 2 % 998244353ll) + f[j] + f[i - j]) %
              998244353ll) %= 998244353ll;
    (sum += g[i] * (1ll * i * (i - 1) / 2 % 998244353ll) % 998244353ll) %=
        998244353ll;
    f[i] = sum * inv(998244353ll + 1 - g[i]) % 998244353ll;
  }
  cout << f[n];
  return 0;
}
