Problem: There is a chess tournament in All-Right-City. n players were invited to take part in the competition. The tournament is held by the following rules:

  1. Initially, each player plays one game with every other player. There are no ties; 
  2. After that, the organizers build a complete directed graph with players as vertices. For every pair of players there is exactly one directed edge between them: the winner of their game is the startpoint of this edge and the loser is the endpoint; 
  3. After that, the organizers build a condensation of this graph. The condensation of this graph is an acyclic complete graph, therefore it has the only Hamiltonian path which consists of strongly connected components of initial graph A1 → A2 → ... → Ak. 
  4. The players from the first component A1 are placed on the first <image> places, the players from the component A2 are placed on the next <image> places, and so on. 
  5. To determine exact place of each player in a strongly connected component, all the procedures from 1 to 5 are repeated recursively inside each component, i.e. for every i = 1, 2, ..., k players from the component Ai play games with each other again, and so on; 
  6. If a component consists of a single player, then he has no more rivals, his place is already determined and the process stops. 



The players are enumerated with integers from 1 to n. The enumeration was made using results of a previous tournament. It is known that player i wins player j (i < j) with probability p.

You need to help to organize the tournament. Find the expected value of total number of games played by all the players. 

It can be shown that the answer can be represented as <image>, where P and Q are coprime integers and <image>. Print the value of P·Q - 1 modulo 998244353.

If you are not familiar with any of the terms above, you can read about them [here](https://en.wikipedia.org/wiki/Strongly_connected_component).

Input

The first line of input contains a single integer n (2 ≤ n ≤ 2000) — the number of players.

The second line contains two integers a and b (1 ≤ a < b ≤ 100) — the numerator and the denominator of fraction <image>.

Output

In the only line print the expected value of total number of games played by all the players. Print the answer using the format above.

Examples

Input

3
1 2


Output

4


Input

3
4 6


Output

142606340


Input

4
1 2


Output

598946623

Note

In the first example the expected value is 4.

In the second example the expected value is <image>.

In the third example the expected value is <image>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int N;
int a, b;
bool read() {
  if (scanf("%d", &N) < 1) {
    return 0;
  }
  scanf("%d%d", &a, &b);
  return 1;
}
const int MAXN = 2e3 + 10;
namespace double_solver {
double ans[MAXN];
double dp[MAXN];
double p_full[MAXN];
double f[MAXN][MAXN];
double pow_p[MAXN];
double pow_q[MAXN];
double solve() {
  const double p = a * 1.0 / b;
  const double q = 1 - p;
  pow_p[0] = pow_q[0] = 1;
  for (int i = 1; i < MAXN; ++i) {
    pow_p[i] = pow_p[i - 1] * p;
    pow_q[i] = pow_q[i - 1] * q;
  }
  memset(f, 0, sizeof f);
  for (int n = 0; n <= N; ++n) {
    for (int k = 0; k <= n; ++k) {
      if (k == 0) {
        f[n][k] = 1;
        continue;
      }
      f[n][k] += f[n - 1][k - 1] * pow_p[n - k];
      if (n > k) {
        f[n][k] += f[n - 1][k] * pow_q[k];
      }
    }
  }
  p_full[0] = 0;
  for (int n = 1; n <= N; ++n) {
    double bad = 0;
    for (int k = 1; k < n; ++k) {
      bad += f[n][k] * p_full[k];
    }
    p_full[n] = 1 - bad;
    ;
    ;
  }
  memset(dp, 0, sizeof dp);
  memset(ans, 0, sizeof ans);
  ans[0] = 0;
  dp[0] = 0;
  for (int n = 2; n <= N; ++n) {
    dp[n] = 0;
    for (int k = 1; k < n; ++k) {
      dp[n] += f[n][k] * p_full[k] * (ans[k] + dp[n - k]);
    }
    double pairs = n * (n - 1) / 2;
    ans[n] = (dp[n] + pairs) / (1 - p_full[n]);
    dp[n] += f[n][n] * p_full[n] * ans[n];
    ;
    ;
  }
  return ans[N];
}
};  // namespace double_solver
const int MOD = 998244353;
void add(int& x, int y) { ((x += y) >= MOD) && (x -= MOD); }
void sub(int& x, int y) { add(x, -y + MOD); }
int mul(int x, int y) { return x * 1ll * y % MOD; }
int mpow(int a, int p) {
  int res = 1;
  for (; p > 0; p >>= 1, a = mul(a, a)) {
    if (p & 1) {
      res = mul(res, a);
    }
  }
  return res;
}
int inv(int x) {
  int y = mpow(x, MOD - 2);
  assert(mul(x, y) == 1);
  return y;
}
namespace int_solver {
int ans[MAXN];
int dp[MAXN];
int p_full[MAXN];
int f[MAXN][MAXN];
int pow_p[MAXN];
int pow_q[MAXN];
double solve() {
  const int p = mul(a, inv(b));
  const int q = (1 - p + MOD) % MOD;
  pow_p[0] = pow_q[0] = 1;
  for (int i = 1; i < MAXN; ++i) {
    pow_p[i] = mul(pow_p[i - 1], p);
    pow_q[i] = mul(pow_q[i - 1], q);
  }
  memset(f, 0, sizeof f);
  for (int n = 0; n <= N; ++n) {
    for (int k = 0; k <= n; ++k) {
      if (k == 0) {
        f[n][k] = 1;
        continue;
      }
      add(f[n][k], mul(f[n - 1][k - 1], pow_p[n - k]));
      if (n > k) {
        add(f[n][k], mul(f[n - 1][k], pow_q[k]));
      }
    }
  }
  p_full[0] = 0;
  for (int n = 1; n <= N; ++n) {
    int bad = 0;
    for (int k = 1; k < n; ++k) {
      add(bad, mul(f[n][k], p_full[k]));
    }
    p_full[n] = 1;
    sub(p_full[n], bad);
    ;
    ;
  }
  memset(dp, 0, sizeof dp);
  memset(ans, 0, sizeof ans);
  ans[0] = 0;
  dp[0] = 0;
  for (int n = 2; n <= N; ++n) {
    dp[n] = 0;
    for (int k = 1; k < n; ++k) {
      int cur = mul(f[n][k], p_full[k]);
      int rec = ans[k];
      add(rec, dp[n - k]);
      cur = mul(cur, rec);
      add(dp[n], cur);
    }
    const int pairs = n * (n - 1) / 2;
    ans[n] = dp[n];
    add(ans[n], pairs);
    const int q_full = (1 - p_full[n] + MOD) % MOD;
    ans[n] = mul(ans[n], inv(q_full));
    add(dp[n], mul(mul(f[n][n], p_full[n]), ans[n]));
    ;
    ;
  }
  return ans[N];
}
};  // namespace int_solver
int main() {
  while (read()) {
    int ans = int_solver::solve();
    printf("%d\n", ans);
  }
  return 0;
}