#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <cstdlib>
#include <unordered_map>
#include <random>
#include <chrono>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define debug() cout<<"qwq"<<endl
#define mem(i,a) memset(i,a,sizeof(i))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
#define i128 __int128
#define pii pair<int,int>
const db eps=1e-10;
const ll INF = 0x3f3f3f3f;
const int siev =1000000+5;
const int inf = 0x3f3f3f3f;
const int DMAX = 1000000 + 10;
const int G=3;
const int invG=332748118;
const double PI=acos(-1.0);
const int MOD = 998244353;
const int LMOD = 1000000007;
const int hmod = 202010923;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<class T> inline void print(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    int a[20];
    int cnt=0;
    do{
        a[++cnt]=x%10;
        x/=10;
    }while(x>0);
    for(int i=cnt;i>=1;i--){
        putchar(a[i]+'0');
    }
    putchar('\n');
    // puts("");
}
template<class T> inline void read(T &x){
    x=0;
    T f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-'){
            f=-1;
        }
        ch=getchar();
    }
    while(ch<='9' && ch>='0'){
        x=x*10+(ch-'0');
        ch=getchar();
    }
    x*=f;
}
int n,m;
struct node{
    int x,y;
};
node nde[DMAX];
int dist(int px,int py,int lx,int ly){
    // if(px<=rx && px>=lx){
    //     ll d=min(abs(py-ly),abs(py-ry));
    //     return (int)d;
    // }
    // if(py<=max(ly,ry) && py>=min(ly,ry)){
    //     ll d=min(abs(px-lx),abs(px-rx));
    //     return (int)d;
    // }
    // int delx=min(abs(px-lx),abs(px-rx));
    // int dely=min(abs(py-ly),abs(py-ry));
    // ll d=0ll+1ll*delx*delx+1ll*dely*dely;
    int delx=abs(px-lx),dely=abs(py-ly);
    ll d=0ll+1ll*delx*delx+1ll*dely*dely;
    ll res=floor(sqrt(d));
    if(res*res==d){
        res--;
    }
    return (int)res;
}
int main(){
    read(n),read(m);
    for(int i=1;i<=n;i++){
        read(nde[i].x),read(nde[i].y);
    }
    int px,py,qx,qy;
    for(int i=1;i<=m;i++){
        read(px),read(py),read(qx),read(qy);
        bool flag=1;
        for(int j=1;j<=n;j++){
            if(nde[j].x<=qx && nde[j].x>=qx && nde[j].y<=max(py,qy) && nde[j].y>=min(py,qy)){
                flag=0;
                break;
            }
        }
        if(!flag){
            puts("-1");
            continue;
        }
        int mn=2e7;
        for(int j=1;j<=n;j++){
            mn=min(mn,dist(nde[j].x,nde[j].y,qx,qy));
        }
        int ned=abs(px-qx)+abs(py-qy)+1;
        print((mn-ned<0) ? -1:mn-ned);
    }
    return 0;
}