#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x;
}
long long ans[2005], str[2005];
long long mp[2005], ip[2005];
long long cp[2005][2005], p, np;
inline long long qpow(long long a, long long b) {
  long long res = 1, tp = a;
  while (b) {
    if (b & 1ll) {
      res *= tp;
      res %= 998244353ll;
    }
    tp *= tp;
    tp %= 998244353ll;
    b >>= 1ll;
  }
  return res;
}
int main() {
  int n = read(), i, j;
  p = 1ll * read() * qpow(read(), 998244353ll - 2) % 998244353ll;
  np = (1 - p < 0 ? 1 - p + 998244353ll : 1 - p);
  mp[0] = 1;
  ip[0] = 1;
  for (i = 1; i <= n; i++) {
    mp[i] = mp[i - 1] * p;
    mp[i] %= 998244353ll;
    ip[i] = ip[i - 1] * np;
    ip[i] %= 998244353ll;
  }
  cp[0][0] = 1;
  for (i = 1; i <= n; i++) {
    cp[i][0] = 1;
    for (j = 1; j <= i; j++) {
      cp[i][j] = cp[i - 1][j] * ip[j] + cp[i - 1][j - 1] * mp[i - j];
      cp[i][j] %= 998244353ll;
    }
  }
  str[0] = str[1] = 1;
  for (i = 2; i <= n; i++) {
    str[i] = 1;
    for (j = 1; j < i; j++) {
      str[i] -= str[j] * cp[i][j];
      str[i] %= 998244353ll;
      if (str[i] < 0) str[i] += 998244353ll;
    }
  }
  ans[0] = ans[1] = 0;
  for (i = 2; i <= n; i++) {
    long long tp = 0;
    for (j = 1; j < i; j++) {
      long long prob = cp[i][j] * str[j] % 998244353ll;
      long long ctr = ans[j] + ans[i - j] + j * (j - 1) / 2 + j * (i - j);
      tp += prob * ctr;
      tp %= 998244353ll;
    }
    long long prob = cp[i][i] * str[i] % 998244353ll;
    long long ctr = i * (i - 1) / 2;
    tp += prob * ctr;
    tp %= 998244353ll;
    prob = qpow(998244353ll + 1 - prob, 998244353ll - 2);
    ans[i] = prob * tp % 998244353ll;
  }
  printf("%lld\n", ans[n]);
  return 0;
}
