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

//座標を表す構造体
struct coord{
    long long x,y;
    bool operator==(coord&other){
        return this->x==other.x && this->y==other.y;
    }
};

int main(){
    int N,M;
    cin>>N>>M;

    vector<vector<coord>> xy(N);
    
    for(int i=0;i<N;i++){
        long long x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        xy[i]={{x1,y1},{x2,y2}};
    }

    //Floyd-Warshall法を実行する
    vector<vector<double>> dp(N+N,vector<double>(N+N,1E18));
    //DPテーブルの初期化
    for(int i=0;i<N+N;i++){
        for(int j=0;j<N+N;j++){
            if(i==j){
                dp[i][j]=0;
                continue;
            }
            coord xy1=xy[i%N][i/N],xy2=xy[j%N][j/N];
            bool flag=true;
            for(int k=0;k<N;k++){
                coord xy3=xy[k][0],xy4=xy[k][1];
                if(xy3==xy1 || xy3==xy2 || xy4==xy1 || xy4==xy2){
                    continue;
                }

                //線分の交差判定
                long long s=(xy1.x-xy2.x)*(xy3.y-xy1.y)-(xy1.y-xy2.y)*(xy3.x-xy1.x),
                t=(xy1.x-xy2.x)*(xy4.y-xy1.y)-(xy1.y-xy2.y)*(xy4.x-xy1.x),
                s2=(xy3.x-xy4.x)*(xy1.y-xy3.y)-(xy3.y-xy4.y)*(xy1.x-xy3.x),
                t2=(xy3.x-xy4.x)*(xy2.y-xy3.y)-(xy3.y-xy4.y)*(xy2.x-xy3.x);

                if(!(s*t>=0 || s2*t2>=0)){
                    flag=false;
                    break;
                }
            }
            if(flag){
                dp[i][j]=sqrt((xy1.x-xy2.x)*(xy1.x-xy2.x)+(xy1.y-xy2.y)*(xy1.y-xy2.y));
            }
        }
    }
    //DPテーブルの更新
    for(int k=0;k<N+N;k++){
        for(int i=0;i<N+N;i++){
            for(int j=0;j<N+N;j++){
                dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
            }
        }
    }
    //クエリに答える
    cout<<setprecision(20);
    while(M--){
        int a,b,c,d;cin>>a>>b>>c>>d;
        cout<<dp[a-1+(b-1)*N][c-1+(d-1)*N]<<'\n';
    }
}