#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int n;
long long a, b;
long long Q[2100], P[2100], f[2100][2100], s[2100], ans[2100];
long long power(long long x, long long y) {
  long long ans = 1, t = x, w = y;
  while (w) {
    if (w % 2) ans = ans * t % MOD;
    w = w / 2;
    t = t * t % MOD;
  }
  return ans;
}
int main() {
  scanf("%d", &n);
  scanf("%lld%lld", &a, &b);
  for (int i = 0; i <= n; i++) f[i][0] = 1;
  int p = a * power(b, MOD - 2) % MOD, q = MOD + 1 - p;
  P[0] = 1;
  for (int i = 1; i <= n; i++) P[i] = P[i - 1] * p % MOD;
  Q[0] = 1;
  for (int i = 1; i <= n; i++) Q[i] = Q[i - 1] * q % MOD;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= i; j++)
      f[i][j] =
          (f[i - 1][j] * Q[j] % MOD + f[i - 1][j - 1] * P[i - j] % MOD) % MOD;
  s[1] = 1;
  for (int i = 2; i <= n; i++) {
    s[i] = 1;
    for (int j = 1; j < i; j++)
      s[i] = ((s[i] - s[j] * f[i][j] % MOD) % MOD + MOD) % MOD;
  }
  ans[1] = 0;
  ans[0] = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j < i; j++)
      ans[i] = (ans[i] +
                s[j] * f[i][j] % MOD *
                    (((ans[j] + (j * (j - 1) / 2 + (i - j) * j) % MOD) % MOD +
                      ans[i - j]) %
                     MOD) %
                    MOD) %
               MOD;
    long long t = power(((1 - s[i] * f[i][i] % MOD) + MOD) % MOD, MOD - 2);
    ans[i] = (ans[i] + s[i] * f[i][i] % MOD * (i * (i - 1) / 2) % MOD) % MOD *
             t % MOD;
  }
  printf("%lld\n", ans[n]);
}
