#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ls (rt<<1)
#define rs (rt<<1|1)
#define mid ((l+r)>>1)
#define lowbit(x) (x&-x)
#define int long long
const int maxn=2e5+5,M=2e5+5,mod=998244353;
inline int read(){
	char ch=getchar();bool f=0;int x=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f==1){x=-x;}return x;
}
void print(int x){
    static int a[55];int top=0;
    if(x<0) putchar('-'),x=-x;
    do{a[top++]=x%10,x/=10;}while(x);
    while(top) putchar(a[--top]+48);
}
int n,m,a[maxn],b[maxn],x,y,xx,yy;
signed main(){
	//freopen("1.in","r",stdin);
	//freopen(".out","w",stdout);
	n=read();m=read();
	for(int i=1;i<=n;i++)a[i]=read(),b[i]=read();
	for(int i=1;i<=m;i++){
		x=read(),y=read(),xx=read(),yy=read();
		int dis=abs(xx-x)+abs(yy-y),mn=1e18;
		for(int j=1;j<=n;j++){
			int d=((a[j]-xx)*(a[j]-xx)+(b[j]-yy)*(b[j]-yy));
			mn=min(mn,d);
		}
		int z=sqrt(mn);
		if(z*z==mn)z--;
		z--;
		//cout<<z<<" "<<mn<<endl;
		if(z<dis){puts("-1");}
		else cout<<z-dis<<endl; 
	}
 	return 0;
}