// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

const int mod = 998244353;

int n, x, y, q;
int inv[5005], down[5005], dp[5005][5005];
struct query{int a, b;} qry[200005];

int Cn(int m) {return (long long)down[m] * inv[m] % mod;}
int power(int a, int b) {
	int ans = 1;
	while (b) {
		if (b & 1) ans = (long long)ans * a % mod;
		a = (long long)a * a % mod;
		b >>= 1;
	}
	return ans % mod;
}

int main() {
	// freopen("count.in", "r", stdin);
	// freopen("count.out", "w", stdout);
	while (scanf("%d%d%d%d", &n, &x, &y, &q) != EOF) {
		int lim = 0;
		for (int i = 1; i <= q; i++)
			scanf("%d%d", &qry[i].a, &qry[i].b), lim = max({lim, qry[i].a, qry[i].b});
		down[0] = 1;
		for (int i = 1; i <= lim; i++) down[i] = (long long)down[i - 1] * (n + 1 - i + 1) % mod;
		inv[0] = inv[1] = 1;
		for (int i = 2; i <= lim; i++)
			inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod;
		for (int i = 2; i <= lim; i++) inv[i] = (long long)inv[i - 1] * inv[i] % mod;
		int invxmy = power((x - y + mod) % mod, mod - 2);
		dp[0][0] = (long long)(power(x, n + 1) - power(y, n + 1) + mod) * invxmy % mod;
		for (int i = 0; i <= min(n, lim); i++)
			for (int j = 0; j <= min(n, lim) && i + j <= n; j++)
				if (i || j) {
					if (!i)
						dp[i][j] =
							(dp[i][j - 1] - (long long)Cn(j) * power(y, n + 1 - j) % mod + mod) * invxmy % mod;
					if (!j)
						dp[i][j] =
							((long long)Cn(i) * power(x, n + 1 - i) % mod - dp[i - 1][j] + mod) * invxmy % mod;
					if (i && j) dp[i][j] = (long long)(dp[i][j - 1] - dp[i - 1][j] + mod) * invxmy % mod;
				}
		for (int i = 1; i <= q; i++) printf("%d\n", dp[qry[i].a][qry[i].b]);
	}
	return 0;
}