#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 10, MOD = 998244353;
int n;
long long a, b;
long long c[N][N], dp[N], dp2[N], p1[N], p2[N];
long long pw(long long a, long long b) {
  if (b == 0) return 1LL;
  return pw(a * a % MOD, b / 2) * (b % 2 ? a : 1LL) % MOD;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> a >> b;
  a = a * pw(b, MOD - 2) % MOD;
  b = (1 - a + MOD) % MOD;
  p1[0] = p2[0] = 1;
  for (int i = 1; i < N; i++)
    p1[i] = p1[i - 1] * a % MOD, p2[i] = p2[i - 1] * b % MOD;
  for (int i = 0; i < N; i++) {
    c[i][i] = c[i][0] = 1;
    for (int j = 1; j < i; j++)
      c[i][j] = (c[i - 1][j] * p1[j] + c[i - 1][j - 1] * p2[i - j] % MOD) % MOD;
  }
  for (int i = 1; i <= n; i++) {
    dp2[i] = 1, dp[i] = i * (i - 1) / 2;
    for (int j = 1; j < i; j++) {
      dp2[i] = (dp2[i] - dp2[j] * c[i][j] % MOD + MOD) % MOD;
      dp[i] =
          (dp[i] + dp2[j] * c[i][j] % MOD *
                       ((dp[j] + dp[i - j] - (i - j) * (i - j - 1) / 2) % MOD) %
                       MOD) %
          MOD;
    }
    dp[i] = dp[i] * pw(1 - dp2[i] + MOD, MOD - 2) % MOD;
  }
  cout << dp[n] << endl;
  return 0;
}
