#include<fstream>
using namespace std;
int C,N,a[3][100001],i,x,y,x1,y2;
ifstream f("gropi.in");
ofstream g("gropi.out");
void prog()
{
	int pas=0;
	f>>x>>y>>x1>>y2;
	while(y<y2)
	{
		if(a[x][y+1]==0)
		{
			y++;
			pas++;
		}
		else
		{
			if(x==1) x=2;
			else x=1;
			pas++;
		}
	}
	while(y>y2)
	{
		if(a[x][y-1]==0)
		{
			y--;
			pas++;
		}
		else
		{
			if(x==1) x=2;
			else x=1;
			pas++;
		}
	}
	if(x!=x1) pas++;
	g<<pas+1<<'\n';
	
}
int main()
{

	f>>C>>N;
	for(i=1;i<=N;i++)
	{
		f>>x>>y;
		a[x][y]=1;
	}
	f>>N;
	for(i=1;i<=N;i++)
		prog();
	g.close();
	f.close();
	return 0;
}