#include <bits/stdc++.h>
using namespace std;
const int P(998244353);
long long mpower(long long a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % P;
    a = a * a % P;
    b >>= 1;
  }
  return ret;
}
int n, p, cp[2005][2005], st[2005], ans[2005];
int main() {
  {
    int a, b;
    scanf("%d%d%d", &n, &a, &b);
    p = a * mpower(b, P - 2) % P;
  }
  cp[0][0] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 0; j <= i; ++j)
      cp[i][j] = (cp[i - 1][j] * mpower(P + 1 - p, j) +
                  (j ? cp[i - 1][j - 1] * mpower(p, i - j) : 0)) %
                 P;
  for (int i = 1; i <= n; ++i) {
    st[i] = 1;
    for (int j = 1; j < i; ++j)
      st[i] = (st[i] - (long long)st[j] * cp[i][j]) % P;
    if (st[i] < 0) st[i] += P;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j < i; ++j)
      ans[i] = (ans[i] + ((long long)j * (i - j) + (long long)j * (j - 1) / 2 +
                          ans[j] + ans[i - j]) %
                             P * st[j] % P * cp[i][j]) %
               P;
    ans[i] = (ans[i] + (long long)i * (i - 1) / 2 % P * st[i]) % P;
    ans[i] = ans[i] * mpower((P + 1 - st[i]) % P, P - 2) % P;
  }
  printf("%d\n", ans[n]);
  return 0;
}
