#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
#define int long long 
typedef long long ll;
#define ep emplace_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define fin freopen("in.in","r",stdin);
inline int read() {
	int x=0, v=1,ch=getchar();
	while('0'>ch||ch>'9') {
		if(ch=='-') v=0;
		ch=getchar();
	}while('0'<=ch&&ch<='9') {
		x=(x*10)+(ch^'0');
		ch=getchar();
	}return v?x:-x;
}
const int MAX = 1005;
int n,q;
int x[MAX], y[MAX];
int dis(int a,int b){
	return ceil(sqrt(1.0 * (x[a] - x[b]) * (x[a] - x[b]) + (y[a] - y[b]) * (y[a] - y[b])));
}
int my(int x) {
	return x < 0 ? -x : x;
}
signed main() {
	n = read(), q = read();
	for(int i=1;i<=n;++i) {
		x[i] = read(), y[i] = read();
	}++ n;
	while(q --) {
		x[0] = read(), y[0] = read();
		x[n] = read(), y[n] = read();
		int d = 1e18;
		for(int i=1;i<n;++i) {
			d = min(d, dis(i, n));
		}
		int dd = my(x[n] - x[0]) + my(y[n] - y[0]);
		if(d - dd - 2 < 0) {
			puts("-1");
		}else {
			printf("%lld\n",d - dd - 2);
		}
	}
	return 0;
}