#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000+10;
const double eps=1e-6;
int n,q;
struct node{
	int x,y;
}p[N];
int x,y,s,t,d;
ll getdis(int i,int j){
	return 1ll*(p[i].x-p[j].x)*(p[i].x-p[j].x)+1ll*(p[i].y-p[j].y)*(p[i].y-p[j].y);
}
bool check(int mid){
	ll v1=1ll*(mid+1)*(mid+1),v2=1ll*(mid+d+1)*(mid+d+1);
	for(int i=1;i<=n;i++)if(getdis(i,n+1)<=v1||getdis(i,n+2)<=v2)return false;
	return true;
}
int main(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)scanf("%d%d",&p[i].x,&p[i].y);
	while(q--){
		
		scanf("%d%d%d%d",&p[n+1].x,&p[n+1].y,&p[n+2].x,&p[n+2].y);
		d=abs(p[n+2].x-p[n+1].x)+abs(p[n+2].y-p[n+1].y);
		int l=0,r=1e6,mid=0,res=-1;
		while(l<=r){
			mid=(l+r)/2;
			if(check(mid))l=mid+1,res=mid;
			else r=mid-1;
		}
		printf("%d\n",res);
	}
	return 0;
}