#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
unsigned long long dp[2022], pr[2022][2022], win[2022][2022];
unsigned long long pw[2022], qw[2022];
int main() {
  unsigned long long n, a, b;
  cin >> n >> a >> b;
  unsigned long long p = a * power(b, 998244353 - 2, 998244353) % 998244353;
  pw[0] = 1;
  unsigned long long q = (1 - p + 998244353) % 998244353;
  qw[0] = 1;
  for (int i = 1; i <= n; i++)
    pw[i] = pw[i - 1] * p % 998244353, qw[i] = qw[i - 1] * q % 998244353;
  pr[1][1] = win[1][1] = 1;
  pr[1][0] = win[1][0] = 1;
  for (int i = 2; i <= n; i++) {
    unsigned long long tmp = 0;
    win[i][0] = 1;
    for (int j = 1; j < i; j++) {
      win[i][j] = (win[i - 1][j] * pw[j] % 998244353 +
                   win[i - 1][j - 1] * qw[i - j] % 998244353) %
                  998244353;
      pr[i][j] = win[i][j] * pr[j][j] % 998244353;
      tmp += pr[i][j];
      if (tmp >= 998244353) tmp -= 998244353;
    }
    win[i][i] = 1;
    pr[i][i] = (1 - tmp + 998244353) % 998244353;
  }
  dp[1] = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= i - 1; j++) {
      dp[i] += pr[i][j] *
               ((dp[i - j] + dp[j] + j * (i - j) + ((j) * (j - 1) / 2)) %
                998244353) %
               998244353;
      dp[i] %= 998244353;
    }
    int tmp = (1 - pr[i][i] + 998244353) % 998244353;
    tmp = power(tmp, 998244353 - 2, 998244353);
    dp[i] += i * (i - 1) / 2 * pr[i][i] % 998244353;
    dp[i] %= 998244353;
    dp[i] = tmp * dp[i] % 998244353;
  }
  cout << dp[n] << endl;
  return 0;
}
