Snuke found a random number generator. It generates an integer between 0 and N-1 (inclusive). An integer sequence A_0, A_1, \cdots, A_{N-1} represents the probability that each of these integers is generated. The integer i (0 \leq i \leq N-1) is generated with probability A_i / S, where S = \sum_{i=0}^{N-1} A_i. The process of generating an integer is done independently each time the generator is executed.

Now, Snuke will repeatedly generate an integer with this generator until the following condition is satisfied:

* For every i (0 \leq i \leq N-1), the integer i has been generated at least B_i times so far.



Find the expected number of times Snuke will generate an integer, and print it modulo 998244353. More formally, represent the expected number of generations as an irreducible fraction P/Q. Then, there exists a unique integer R such that R \times Q \equiv P \pmod{998244353},\ 0 \leq R < 998244353, so print this R.

From the constraints of this problem, we can prove that the expected number of generations is a finite rational number, and its integer representation modulo 998244353 can be defined.

Constraints

* 1 \leq N \leq 400
* 1 \leq A_i
* \sum_{i=0}^{N-1} A_i \leq 400
* 1 \leq B_i
* \sum_{i=0}^{N-1} B_i \leq 400
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_0 B_0
A_1 B_1
\vdots
A_{N-1} B_{N-1}


Output

Print the expected number of times Snuke will generate an integer, modulo 998244353.

Examples

Input

2
1 1
1 1


Output

3


Input

3
1 3
2 2
3 1


Output

971485877


Input

15
29 3
78 69
19 15
82 14
9 120
14 51
3 7
6 14
28 4
13 12
1 5
32 30
49 24
35 23
2 9


Output

371626143
#include <bits/stdc++.h>

typedef long long LL;
typedef unsigned long long ULL;

#define debug printf("fuck %d\n", __LINE__);

inline LL read() {
	LL res = 0, bo = 1; char ch = getchar();
	while(ch < '0' || ch > '9') { if (ch == '-') bo = -1; ch = getchar(); }
	while(ch >= '0' && ch <= '9') { res = (res << 1) + (res << 3) + ch - '0'; ch = getchar(); }
	return bo * res;
}

template<typename T> void read(T &x) { x = read(); }
template<typename T, typename ...Argv> void read(T &a, Argv &...argv) { read(a); read(argv...); }

const int N = 405, p = 998244353;
int n, A[N], B[N], SA, SB, inv[N], fac[N], a[N][N], f[N][N][N];

int mul(int x, int y) { return 1LL * x * y % p; }
void add(int &x, int y) { x += y; if (x >= p) x -= p; }
void del(int &x, int y) { x -= y; if (x < 0) x += p; }

int ksm(int x, int y) {
	int res = 1;
	for (; y; y >>= 1, x = mul(x, x)) if (y & 1) res = mul(res, x);
	return res;
}

int main() {
	n = read();
	for (int i = 1; i <= n; ++ i) read(A[i], B[i]), SA += A[i], SB += B[i];
	fac[0] = 1;
	for (int i = 1; i <= 400; ++ i) fac[i] = mul(fac[i - 1], i);
	inv[400] = ksm(fac[400], p - 2);
	for (int i = 399; i >= 0; -- i) inv[i] = mul(inv[i + 1], i + 1);
	for (int i = 1; i <= n; ++ i) {
		a[i][0] = 1;
		for (int j = 1; j <= SB; ++ j) {
			a[i][j] = mul(a[i][j - 1], A[i]);
		}
	}
	f[0][0][0] = p - 1;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 0; j <= SA; ++ j) {
			for (int k = 0; k <= SB; ++ k) {
				// if (!f[i - 1][j][k]) continue;
				add(f[i][j][k], f[i - 1][j][k]);
				for (int l = 0; l < B[i]; ++ l) {
					if (A[i] > j || l > k) break;
					del(f[i][j][k], mul(f[i - 1][j - A[i]][k - l], mul(a[i][l], inv[l])));
				}
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= SA; ++ i) {
		int inv = ksm(i, p - 2), t = mul(SA, inv);
		for (int j = 0; j <= SB; ++ j) add(ans, mul(f[n][i][j], mul(t, fac[j]))), t = mul(t, inv);
	}
	std::cout << ans << std::endl;
	return 0;
}