#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const double EPS=1e-9;
const int MAX=310;
const int INF=1e9+7;

double dis[MAX][MAX];
int n,m;

void floyd(){
  rep(k,2*n){
    rep(i,2*n){
      if(dis[i][k]>INF-EPS) continue;
      rep(j,2*n){
        if(dis[k][j]>INF-EPS) continue;
        dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
      }
    }
  }
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  cin>>n>>m;
  rep(i,2*n){
    rep(j,2*n){
      if(i==j) dis[i][j]=0;
      else dis[i][j]=INF;
    }
  }
  vector<double> X(2*n),Y(2*n);
  rep(i,2*n) cin>>X[i]>>Y[i];
  vector<int> A(m),B(m),C(m),D(m);
  rep(i,m){
    cin>>A[i]>>B[i]>>C[i]>>D[i];
    A[i]--,B[i]--,C[i]--,D[i]--;
  }
  
  auto cross=[&](int a,int b,int c)->double{
    return (X[b]-X[a])*(Y[c]-Y[a])-(Y[b]-Y[a])*(X[c]-X[a]);
  };
  auto f=[&](int a,int b,int c,int d)->bool{
    if(cross(a,b,c)*cross(a,b,d)<0 && cross(c,d,a)*cross(c,d,b)<0) return false;
    return true;
  }; 
  auto g=[&](int i,int j)->double{
    return sqrt((X[i]-X[j])*(X[i]-X[j])+(Y[i]-Y[j])*(Y[i]-Y[j]));
  };
  
  rep(i,2*n){
    for(int j=i+1;j<2*n;j++){
      bool e=true;
      for(int k=0;k<n;k++){
        if(k==i/2 || k==j/2) continue;
        if(f(i,j,2*k,2*k+1)==false) e=false;
      }
      if(e){
        dis[i][j]=g(i,j);
        dis[j][i]=dis[i][j];
      }
    }
  }
  floyd();
  rep(i,m){
    printf("%.30f\n",dis[2*A[i]+B[i]][2*C[i]+D[i]]);
  }
  
  return 0;
}