#include <bits/stdc++.h>
using namespace std;
const int N = 2005, mod = 998244353;
int n;
long long A, B, p, pw[N], pw2[N], f[N], g[N][N], h[N];
long long Pow(long long x, long long k) {
  long long ret = 1;
  while (k) {
    if (k & 1) ret = ret * x % mod;
    k >>= 1;
    x = x * x % mod;
  }
  return ret;
}
long long C2(long long n) { return n * (n - 1) / 2; }
int main() {
  scanf("%d%d%d", &n, &A, &B);
  p = (long long)A * Pow(B, mod - 2) % mod;
  pw[0] = pw2[0] = 1;
  for (int i = 1; i <= n; i++) {
    pw[i] = pw[i - 1] * p % mod;
    pw2[i] = pw2[i - 1] * (1 - p) % mod;
  }
  for (int i = 0; i <= n; g[i++][0] = 1)
    for (int j = 1; j <= i; j++) {
      g[i][j] = (g[i - 1][j] * pw2[j] + g[i - 1][j - 1] * pw[i - j]) % mod;
    }
  for (int i = 1; i <= n; i++) {
    h[i] = 1;
    for (int j = 1; j < i; j++) h[i] = (h[i] - h[j] * g[i][j]) % mod;
  }
  for (int i = 1; i <= n; i++) {
    long long tot = 0;
    for (int j = 1; j <= i; j++)
      tot = (tot + g[i][j] * h[j] % mod *
                       ((C2(j) + j * (i - j) + f[i - j] + f[j]) % mod)) %
            mod;
    f[i] = tot * Pow(1 - g[i][i] * h[i] % mod, mod - 2) % mod;
  }
  cout << (f[n] + mod) % mod << "\n";
}
