#include<iostream>
#include<cstdio>
#define N 300000
#define M 524288
#define K 20
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pows(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
struct reads
{
	int d[N+1];
};
reads e,c,zero,nw,res;
int n,m,length,T,q,ans,num[M+1],A[M+1],B[M+1],rev[M+1],s[M+1],wn[K+1][M+1],wn2[K+1][M+1];
inline void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=1;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2,w;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2,w;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		s1=fast_pows(limit,mod-2);
		for (int i=0;i<=limit;++i) s[i]=1ll*s[i]*s1%mod;
	}
	return;
}
int limit=1;
inline reads operator * (reads a,reads b)
{
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=0;i<m;++i) A[i]=a.d[i],B[i]=b.d[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<m;++i) c.d[i]=MD(A[i]+A[i+m]);
	return c;
}
inline reads solve(reads a)
{
	for (int i=0;i<=limit;++i) A[i]=0;
	for (int i=0;i<m;++i) A[i]=a.d[i];
	NTT(limit,A,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*A[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<m;++i) c.d[i]=MD(A[i]+A[i+m]);
	return c;
}
reads fast_pow(reads a,int b)
{
	reads res=e,mul=a;
	while (b)
	{
		if (b&1) res=res*mul;
		mul=solve(mul),b>>=1;
	}
	return res;
}
int calc(int x,int y)
{ 
	if ((x+y+T)&1) return 0;
	int sx=((x+y+T)>>1)%m,sy=(((x-y+T)>>1)+m)%m;
	return MD(1ll*res.d[sx]*res.d[sy]%mod+1ll*res.d[(sx+(m>>1))%m]*res.d[(sy+(m>>1))%m]%mod);
}
int main()
{
	int xs,ys,xt,yt;
	n=read(),T=read(),q=read(),m=(n<<1)+4,e.d[0]=nw.d[0]=nw.d[1]=1;
	while (limit<=(m<<1)) limit<<=1;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?(limit>>1):0);
	for (int i=2,w;i<=limit;i<<=1)
	{
		num[i]=++length,w=fast_pows(g,(mod-1)/i);
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn[num[i]][j]=res;
		w=fast_pows(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn2[num[i]][j]=res;
	}
	res=fast_pow(nw,T);
	while (q--)
	{
		xs=read(),ys=read(),xt=read(),yt=read(),ans=0;
		Adder(ans,calc((xt+m-xs)%m,(yt+m-ys)%m));
		Adder2(ans,-calc((((n+1)<<1)-xt+m-xs)%m,(yt+m-ys)%m));
		Adder2(ans,-calc((xt+m-xs)%m,(((n+1)<<1)-yt+m-ys)%m));
		Adder(ans,calc((((n+1)<<1)-xt+m-xs)%m,(((n+1)<<1)-yt+m-ys)%m));
		printf("%d\n",ans);
	}
	return 0;
}