#include <bits/stdc++.h>

const int mod = 998244353;

inline int inc(int x, int y) { x += y - mod; return x + (x >> 31 & mod); }
inline int dec(int x, int y) { x -= y; return x + (x >> 31 & mod); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
inline void upd(int &x, int y) { x = inc(x, y); }
inline void dpu(int &x, int y) { x = dec(x, y); }
inline void pud(int &x, int y) { x = mul(x, y); }
inline int fastpow(int x, int p) {
	int r = 1;
	while (p) {
		if (p & 1) r = mul(r, x);
		x = mul(x, x);
		p >>= 1;
	}
	return r;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int n, x, y, q;
	const int lim = 2e5 + 50;
	std::vector<int> inv(lim), fact(lim), factinv(lim);
	fact[0] = 1;
	for (int i = 1; i < lim; ++i)
		fact[i] = mul(i, fact[i - 1]);
	factinv[lim - 1] = fastpow(fact[lim - 1], mod - 2);
	for (int i = lim - 2; i >= 0; --i) {
		factinv[i] = mul(i + 1, factinv[i + 1]);
	}
	for (int i = 1; i < lim; ++i) {
		assert(mul(fact[i], factinv[i]) == 1);
	}
	for (int i = 1; i < lim; ++i)
		inv[i] = mul(factinv[i], fact[i - 1]);
	auto comb = [&](int n, int m) {
		if (n < m) return 0;
		return mul(mul(fact[n], factinv[m]), factinv[n - m]);
	};
	while (std::cin >> n >> x >> y >> q) {
		if (std::cin.eof()) break;
		std::vector<int> a(q), b(q);
		int mx = 0, prod = 1;
		for (int i = 0; i < q; ++i) {
			std::cin >> a[i] >> b[i];
		}
		mx = std::max(*std::max_element(a.begin(), a.end()), *std::max_element(b.begin(), b.end())) + 1;
		std::vector<std::vector<int>> f(mx + 1, std::vector<int>(mx + 1));
		std::vector<int> binom(2 * mx + 1);
		// C(n + 1, i)
		binom[0] = 1;
		for (int i = 1; i <= 2 * mx; ++i) {
			binom[i] = mul(binom[i - 1], mul(inv[i], n + 2 - i));
		}
		if (x == y) {
			std::vector<int> power(lim);
			power[0] = 1;
			for (int i = 0; i < q; ++i) {
				int z = binom[a[i] + b[i] + 1];
				std::cout << mul(z, fastpow(x, n - a[i] - b[i])) << '\n';
			}	
		}
		else {
			f[0][0] = fastpow(inc(x, y), n);
			int d = fastpow(dec(x, y), mod - 2);
			std::vector<int> pa(mx), pb(mx);
			for (int i = 0; i < mx; ++i) {
				pa[i] = fastpow(x, n + 1 - i);
				pb[i] = fastpow(y, n + 1 - i);
			}
			f[0][0] = mul(d, dec(pa[0], pb[0]));
			for (int i = 1; i < mx; ++i) {
				int A = 0;
				int B = mul(binom[i], pb[i]);
				f[0][i] = dec(A, B);
				A = mul(binom[i], pa[i]);
				B = 0;
				f[i][0] = dec(A, B);
			}
			for (int i = 1; i < mx; ++i) {
				upd(f[0][i], f[0][i - 1]);
				pud(f[0][i], d);
				dpu(f[i][0], f[i - 1][0]);
				pud(f[i][0], d);
			}
			for (int i = 1; i <= mx; ++i)
				for (int j = 1; j <= mx; ++j) {
					dpu(f[i][j], f[i - 1][j]);
					upd(f[i][j], f[i][j - 1]);
					pud(f[i][j], d);
				}
			for (int i = 0; i < q; ++i) {
				std::cout << f[a[i]][b[i]] << '\n';
			}
		}
	}
}