#include <bits/stdc++.h>
using namespace ::std;
const long long maxn = 2100;
const long long mod = 998244353;
const long long inf = 1e9 + 500;
long long poww(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans = (ans * a) % mod;
    }
    a = (a * a) % mod;
    b = (b >> 1);
  }
  return ans;
}
long long doaz(long long a) { return (a * (a - 1) / 2) % mod; }
long long ans[maxn];
long long dpp[maxn][maxn];
long long dpu[maxn][maxn];
long long es[maxn];
int main() {
  long long nn, a, b;
  cin >> nn >> a >> b;
  long long p = (a * poww(b, mod - 2)) % mod;
  long long o = (1 - p + mod) % mod;
  dpp[1][1] = 1;
  dpp[1][0] = 1;
  for (long long n = 2; n <= nn; n++) {
    dpp[n][0] = 1;
    dpp[n][n] = 1;
    for (long long k = 1; k < n; k++) {
      dpp[n][k] =
          (dpp[n - 1][k] * poww(p, k) + dpp[n - 1][k - 1] * poww(o, n - k)) %
          mod;
    }
  }
  es[1] = 1;
  es[2] = 0;
  for (long long n = 1; n <= nn; n++) {
    dpu[n][1] = dpp[n][1];
    dpu[n][2] = 0;
  }
  for (long long n = 3; n <= nn; n++) {
    es[n] = 1;
    for (long long i = 1; i < n; i++) {
      es[n] = (es[n] - (dpu[n][i]) % mod + mod) % mod;
    }
    for (long long i = n; i <= nn; i++) {
      dpu[i][n] = (dpp[i][n] * es[n]) % mod;
    }
  }
  ans[0] = 0;
  ans[1] = 0;
  for (long long n = 2; n <= nn; n++) {
    long long s = 0;
    for (long long i = 1; i < n; i++) {
      s = (s + dpu[n][i] * (ans[i] + ans[n - i] - doaz(n - i))) % mod;
    }
    s += doaz(n);
    s %= mod;
    long long pp = dpu[n][n];
    ans[n] = (s * poww((1 - pp + mod) % mod, mod - 2)) % mod;
  }
  cout << ans[nn];
}
