#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
const long long mod = 998244353;
int n;
long long a, b, p[maxn], rp[maxn], sp[maxn][maxn], f[maxn], ans[maxn];
inline long long ksm(long long x, long long n) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * x % mod;
    n >>= 1;
    x = x * x % mod;
  }
  return ret;
}
int main() {
  scanf("%d%I64d%I64d", &n, &a, &b);
  sp[0][0] = p[0] = rp[0] = 1;
  p[1] = a * ksm(b, mod - 2) % mod;
  rp[1] = (1 - p[1] + mod) % mod;
  for (int i = 2; i <= n; ++i)
    p[i] = p[i - 1] * p[1] % mod, rp[i] = rp[i - 1] * rp[1] % mod;
  for (int i = 1; i <= n; ++i)
    for (int j = 0; j <= i; ++j) {
      if (j) sp[i][j] = (sp[i - 1][j - 1] * rp[i - j]) % mod;
      sp[i][j] = (sp[i][j] + sp[i - 1][j] * p[j]) % mod;
    }
  for (int i = 1; i <= n; ++i) {
    f[i] = 1;
    for (int j = 1; j < i; ++j)
      f[i] = ((f[i] - f[j] * sp[i][j]) % mod + mod) % mod;
  }
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j < i; ++j)
      ans[i] = (ans[i] +
                (j * (j - 1) / 2 % mod + j * (i - j) + ans[j] + ans[i - j]) %
                    mod * f[j] % mod * sp[i][j] % mod) %
               mod;
    ans[i] = (ans[i] + f[i] * i * (i - 1) / 2) % mod;
    ans[i] = ans[i] * ksm((1 - f[i] + mod) % mod, mod - 2) % mod;
  }
  return cout << ans[n] << endl, 0;
}
