#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; //const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; //const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } //0-indexed,2冪のセグメントツリー template struct SegTree { private: int n;// 葉の数 vector data;// データを格納するvector T def; // 初期値かつ単位元 function operation; // 区間クエリで使う処理 function change;// 点更新で使う処理 T find(int a, int b) { T val_left = def, val_right = def; for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1) { if ((a & 1) == 0){ val_left = operation(val_left, data[a]); } if ((b & 1) == 0){ val_right = operation(data[--b],val_right); } } return operation(val_left, val_right); } public: // _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数, // _change:更新関数 SegTree(size_t _n, T _def, function _operation, function _change=[](T a,T b){return b;}) : def(_def), operation(_operation), change(_change) { n = 1; while (n < _n) { n *= 2; } data = vector(2 * n - 1, def); } void set(int i, T x) { data[i + n - 1] = x; } void build() { for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]); } // 場所i(0-indexed)の値をxで更新 void update(int i, T x) { i += n - 1; data[i] = change(data[i], x); while (i > 0) { i = (i - 1) / 2; data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]); } } T all_prod(){ return data[0]; } // [a, b)の区間クエリを実行 T query(int a, int b) { //return _query(a, b, 0, 0, n); return find(a,b); } // 添字でアクセス T operator[](int i) { return data[i + n - 1]; } }; template class Seg2D{ int H=1,W=1; T def; function operation; function change; vector height; vector> width; vector> st; public: Seg2D(vector x,vector y,T _def,function _operation,function _change){ def=_def; operation=_operation;change=_change; height=x;sort(all(height)); height.erase(unique(all(height)),height.end()); while(H=0;i--){ merge(all(width[i*2+1]),all(width[i*2+2]),back_inserter(width[i])); width[i].erase(unique(all(width[i])),width[i].end()); } rep(i,H*2-1){ //上位のセグメントは両方operationにしてる if(i(width[i].size(),_def,_operation,_operation)); } else{ st.push_back(SegTree(width[i].size(),_def,_operation,_change)); } } } void update(ll x,ll y,T val){ ll idx=lower_bound(all(height),x)-height.begin(); idx+=H-1; while(1){ ll idy=lower_bound(all(width[idx]),y)-width[idx].begin(); st[idx].update(idy,val); if(!idx)break; idx=(idx-1)/2; } } T query(ll _x1,ll _x2,ll _y1,ll _y2){ int x1=lower_bound(all(height),_x1)-height.begin(); int x2=lower_bound(all(height),_x2)-height.begin(); T val_left=def,val_right=def; for(x1+=H-1,x2+=H-1;x1>=1,x2>>=1){ if((x1&1)==0){ int y1=lower_bound(all(width[x1]),_y1)-width[x1].begin(); int y2=lower_bound(all(width[x1]),_y2)-width[x1].begin(); val_left=operation(val_left,st[x1].query(y1,y2)); } if((x2&1)==0){ x2--; int y1=lower_bound(all(width[x2]),_y1)-width[x2].begin(); int y2=lower_bound(all(width[x2]),_y2)-width[x2].begin(); val_right=operation(st[x2].query(y1,y2),val_right); } } return operation(val_left,val_right); } }; ll modpow(ll a,ll n, ll mod) { a%=mod;if(a==0)return 0; ll res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } int main(){ ll h,w;cin >> h >> w; ll n;cin >> n; vector x(n),y(n),z(n); vector rx(n),ry(n),rz(n); rep(i,n){ ll a,b,c;cin >> a >> b>> c;a--;b--; x[i]=a,y[i]=b;z[i]=c; rx[i]=h-1-a,ry[i]=w-1-b; if(c==6||c==9){ c^=(6^9); } rz[i]=c; } Seg2D st(x,y,0,[](ll a,ll b){b+=a;if(b>=MOD9)b-=MOD9;return b;},[](ll a,ll b){return b;}); Seg2D str(rx,ry,0,[](ll a,ll b){b+=a;if(b>=MOD9)b-=MOD9;return b;},[](ll a,ll b){return b;}); rep(i,n){ ll s=x[i]*w+y[i]; s=modpow(2009,s,MOD9); st.update(x[i],y[i],z[i]*s%MOD9); } rep(i,n){ ll s=rx[i]*w+ry[i]; s=modpow(2009,s,MOD9); str.update(rx[i],ry[i],rz[i]*s%MOD9); } ll q;cin >> q; while(q--){ ll lx,ly,rx,ry;cin >> lx >> ly >> rx >> ry; lx--;ly--; auto f=st.query(lx,rx,ly,ry); auto g=str.query(h-rx,h-lx,w-ry,w-ly); ll t1=lx*w+ly,t2=(h-rx)*w+(w-ry); //cout << t1 <<" " << t2 << endl; //cout << h <<" " << rx <<" " << w <<" " << ry << endl; if(t1