#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e3+51;
int n,q;
int a[N],b[N];
inline int read()
{
	char C=getchar();
	int ANS=0,F=1;
	while (C<'0'||C>'9')
	{
		if (C=='-') F=-1;
		C=getchar();
	}
	while (C>='0'&&C<='9')
	{
		ANS=ANS*10+(C-'0');
		C=getchar();
	}
	return ANS*F;
}
int main()
{
	n=read(),q=read();
	for (int i=1;i<=n;i++) a[i]=read(),b[i]=read();
	for (int i=1;i<=q;i++)
	{
		int sx=read(),sy=read();
		int x=read(),y=read();
		int t=abs(sx-x)+abs(sy-y);
		int ans=1e9;
		for (int j=1;j<=n;j++)
		{
			int d=(sqrt(1ll*(a[j]-x)*(a[j]-x)+1ll*(b[j]-y)*(b[j]-y))+0.9999999);
			d--;
			ans=min(ans,d-t-1);
		}
		ans=max(ans,-1);
		cout << ans << endl;
	}
	return 0;
}