#include <iostream>
#include <cstdio>
#define mod 998244353
using namespace std;
typedef long long ll;
ll n,x,y,q;
ll ksm(ll x,ll y) {
	ll res=1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
namespace sol1 {
	ll fac[5001],inv[5001],f[5001][5001];
	inline ll binom(ll x) {return fac[x]*inv[x]%mod;}
	void work() {
		ll m=min(n,5000ll);
		fac[0]=1;
		for(int i=1;i<=m;++i) fac[i]=fac[i-1]*(n-i+2)%mod;
		ll pro=1;
		for(int i=1;i<=m;++i) pro=pro*i%mod;
		inv[m]=ksm(pro,mod-2);
		for(int i=m;i>=1;--i) inv[i-1]=inv[i]*i%mod;
		ll div=ksm(x-y,mod-2);
		for(int i=0;i<=m;++i)
			for(int j=0;j<=m;++j) {
				if(i==0) f[i][j]=-binom(j)*ksm(y,n+1-j)%mod;
				else f[i][j]=-f[i-1][j];
				if(j==0) f[i][j]+=binom(i)*ksm(x,n+1-i)%mod;
				else f[i][j]+=f[i][j-1];
				f[i][j]=f[i][j]*div%mod;
			}
		ll a,b;
		while(q--) {
			scanf("%lld%lld",&a,&b);
			printf("%lld\n",(f[a][b]+mod)%mod);
		}
	}
}
namespace sol2 {
	ll binom(ll n,ll m) {
		ll x=1,y=1;
		for(int i=1;i<=m;++i) {
			x=x*(n-i+1)%mod;
			y=y*i%mod;
		}
		return x*ksm(y,mod-2)%mod;
	}
	void work() {
		ll a,b;
		while(q--) {
			scanf("%lld%lld",&a,&b);
			if(x==0) printf("%lld\n",binom(n-a,b)*ksm(y,n-a-b)%mod);
			else printf("%lld\n",binom(n-b,a)*ksm(x,n-a-b)%mod);
		}
	}
}
int main() {
	while(scanf("%lld%lld%lld%lld",&n,&x,&y,&q)!=EOF) {
		if(x!=0&&y!=0) sol1::work();
		else sol2::work();
	}
	return 0;
}