#include <map>#include <queue>#include <cstdio>#include <cstdlib>#include <ctime>#include <cassert>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define pb push_backconst int N = 2000 + 10;int cnt;vector<int> vec[N];int fa[N];struct Rect{int xl, yl, xr, yr;bool empty;bool read(){empty = 1;return ~scanf("%d%d%d%d",&xl,&yl,&xr,&yr);}bool in(int x1, int y1, int x2, int y2){if(!empty) return 0;if(x1==x2)return x1>xl && x1<xr && y1 == yl && y2 == yr;elsereturn y1>yl && y1<yr && x1 == xl && x2 == xr;} void div(int,int,int,int,int);} rect[N];void Rect::div(int nid, int x1, int y1, int x2, int y2){ if(x1==x2){ rect[++cnt].xl = xl; rect[cnt].xr = x1; rect[cnt].yl = yl; rect[cnt].yr = yr; rect[cnt].empty = 1; rect[++cnt].xl = x1; rect[cnt].xr = xr; rect[cnt].yl = yl; rect[cnt].yr = yr; rect[cnt].empty = 1; } else{ rect[++cnt].xl = xl; rect[cnt].xr = xr; rect[cnt].yl = yl; rect[cnt].yr = y1; rect[cnt].empty = 1; rect[++cnt].xl = xl; rect[cnt].xr = xr; rect[cnt].yl = y1; rect[cnt].yr = yr; rect[cnt].empty = 1; } empty = 0; vec[nid].pb(cnt); vec[nid].pb(cnt-1); vec[cnt].clear(); vec[cnt-1].clear(); fa[cnt] = nid; fa[cnt-1] = nid;}int dep[N], sum[N];void dfs(int u, int deep){dep[u] = deep; sum[u] = 1;for(int i=0;i<vec[u].size();++i){dfs(vec[u][i],deep+1); sum[u] += sum[vec[u][i]];}if(sum[u] > 1) sum[u]--;}int lca(int u, int v){int i;if(dep[u]<dep[v]) swap(u,v);int del = dep[u]-dep[v];for(i=1;i<=del;++i)u = fa[u];while(u!=v){u = fa[u];v = fa[v];}return u;}int find(int x, int y){ for(int i = 1; i <= cnt; ++i) if(rect[i].empty && rect[i].xl < x && rect[i].xr > x && rect[i].yl < y && rect[i].yr > y) return i;}int main(){int n, i, xl, xr, yl, yr, j, Q;while(rect[cnt = 1].read()){scanf("%d%d",&n,&Q); vec[1].clear();for(i=1;i<=n;++i){scanf("%d%d%d%d",&xl,&yl,&xr,&yr);if(xl>xr) swap(xl,xr);if(yl>yr) swap(yl,yr);for(j=1;j<=cnt;++j)if( rect[j].in(xl,yl,xr,yr) ){rect[j].div(j,xl,yl,xr,yr);break;}} assert(cnt==2*n+1); dfs(1,0); while(Q--){ int x1, y1, x2, y2, u, v, mx;scanf("%d%d%d%d",&x1,&y1,&x2,&y2);u = find(x1,y1);v = find(x2,y2); mx = lca(u,v); printf("%dn",n+2-sum[mx]);}}return 0;}
