#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int mod = 998244353;
long long pw(long long x, int n) {
  long long ans = 1;
  while (n) {
    if (n & 1) ans = (ans * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return ans;
}
long long pn[2005], qn[2005];
long long p1[2005][2005], p2[2005], ans[2005];
int main() {
  int n, pa, pb;
  scanf("%d%d%d", &n, &pa, &pb);
  long long p = (pa * pw(pb, mod - 2)) % mod;
  long long q = (1 - p + mod) % mod;
  pn[0] = 1;
  for (int i = 1; i <= n; i++) pn[i] = (pn[i - 1] * p) % mod;
  qn[0] = 1;
  for (int i = 1; i <= n; i++) qn[i] = (qn[i - 1] * q) % mod;
  for (int i = 0; i <= n; i++) {
    p1[i][0] = 1;
    for (int j = 1; j < i; j++)
      p1[i][j] = (p1[i - 1][j] * qn[j] + p1[i - 1][j - 1] * pn[i - j]) % mod;
    p1[i][i] = 1;
  }
  p2[1] = 1;
  for (int i = 2; i <= n; i++) {
    p2[i] = 1;
    for (int j = 1; j < i; j++) p2[i] = (p2[i] - p1[i][j] * p2[j]) % mod;
    if (p2[i] < 0) p2[i] += mod;
  }
  ans[1] = 1;
  for (int i = 2; i <= n; i++) {
    ans[i] = 0;
    for (int j = 1; j < i; j++)
      ans[i] =
          (ans[i] + ((p1[i][j] * p2[j]) % mod) *
                        ((i - j) * j + j * (j - 1) / 2 + ans[i - j] + ans[j])) %
          mod;
    ans[i] = (ans[i] + p2[i] * i * (i - 1) / 2) % mod;
    ans[i] = (ans[i] * pw(1 - p2[i] + mod, mod - 2)) % mod;
  }
  printf("%lld\n", (ans[n] - n + mod) % mod);
  return 0;
}
