#include <bits/stdc++.h>
// #include <windows.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<LL,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1888686661ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }
mt19937_64 genll(time(NULL));
cint D=20,L=1<<D|11;
LL z[D+1][L];
int rev[L];
int minsz(int w)
{
    return (__lg(w)+(w!=(w&-w)));
}
struct Poly
{
    vct <LL> v;
    void NTT(bool opt)
    {
        int d=minsz(sz(v)),l=1<<d;
        v.resize(l);
        For_(i,1,l)
        {
            rev[i]=(rev[i>>1]>>1)|((i&1)<<d-1);
            if(i<rev[i]) swap(v[i],v[rev[i]]);
        }
        For_(k,0,d) for(int i=0;i<l;i+=(1<<k+1)) For_(j,i,i|(1<<k))
        {
            int j2=(j|(1<<k)); LL t=v[j2]*z[k+1][(i^j)]%mod;
            v[j2]=md(v[j]-t); add(v[j],t);
        }
        ret(!opt);
        LL t=inv(1ll*l); for(auto &i:v) mul(i,t);
        reverse(v.begin()+1,v.end());
    }
    void operator *= (Poly A)
    {
        int len=sz(v)+sz(A.v)-1,d=minsz(len),l=1<<d;
        v.resize(l),A.v.resize(l);
        NTT(false),A.NTT(false);
        For_(i,0,l) mul(v[i],A.v[i]);
        NTT(true);
        v.resize(len);
    }
};
void main_init()
{
    For(i,0,D)
    {
        LL t=pw(G,(mod-1ll)>>i),s=1ll;
        For_(j,0,1<<i) z[i][j]=s,mul(s,t);
    }
}
cint N=1.02e5;
int n,m,m2,Q;
LL d[N<<2];
void get(Poly &w,int len)
{
    int len2=sz(w.v);
    For_(i,len,len2) add(w.v[i-len],w.v[i]);
    w.v.resize(len);
}
void init(int &w)
{
    Poly s,x; s.v.resize(m2),x.v.resize(m2);
    For_(i,0,m2) s.v[i]=x.v[i]=0ll; s.v[0]=x.v[1]=x.v[m2-1]=1ll;
    while(w)
    {
        if(w&1)
        { s*=x; get(s,m2); }
        w>>=1;
        x*=x; get(x,m2);
    }
    For_(i,0,m2) d[i]=s.v[i];
    // For_(i,0,m2) printf("%d:%lld\n",i,d[i]);
}
void fun(int &x,int &y)
{
    x+=y; y=x-(y<<1);
}
LL solve2(int x1,int y1,int x2,int y2)
{
    return (d[md(x2-x1,m2)]*d[md(y2-y1,m2)]%mod);
}
LL solve(int x1,int y1,int x2,int y2)
{
    fun(x1,y1),fun(x2,y2);
    return (solve2(x1,y1,x2,y2)+solve2(x1+m,y1+m,x2,y2))%mod;
}
void main_solve()
{
    int stp; in3(n,stp,Q); m=n+2<<1,m2=m<<1;
    init(stp);
    while(Q--)
    {
        int x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
        outll(md(solve(x1,y1,x2,y2)+solve(m-x1-2,m-y1-2,x2,y2)-solve(x1,m-y1-2,x2,y2)-solve(m-x1-2,y1,x2,y2)));
    }
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out1.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/