#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

struct Point {
    i64 x, y;
};

f64 dist(Point p, Point q) {
    i64 dx = p.x - q.x, dy = p.y - q.y;
    return sqrt(dx * dx + dy * dy);
}

using Segment = pair<Point, Point>;

tuple<i64, i64, i64> into_eq(Segment s) {
    i64 dx = s.second.x - s.first.x, dy = s.second.y - s.first.y;
    i64 a = dy, b = -dx;
    i64 c = -(a * s.first.x + b * s.first.y);
    return make_tuple(a, b, c);
}

i64 sgn(i64 x) {
    return x < 0 ? -1 : x > 0 ? 1 : 0;
}

bool cross(Segment s1, Segment s2) {
    REP(iter, 2) {
        auto [a, b, c] = into_eq(s1);
        i64 pc = a * s2.first.x + b * s2.first.y + c;
        i64 t = a * s2.second.x + b * s2.second.y + c;
        if (sgn(pc) * sgn(t) >= 0) {
            return false;
        }
        swap(s1, s2);
    }
    return true;
}

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<Segment> segs(n);
    REP(i, n) {
        cin >> segs[i].first.x >> segs[i].first.y;
        cin >> segs[i].second.x >> segs[i].second.y;
    }
    Vec<Vec<f64>> di(2 * n, Vec<f64>(2 * n, 1e20));
    REP(i, 2 * n) {
        di[i][i] = 0.;
    }
    REP(i, n) REP(u, 2) REP(j, n) REP(v, 2) {
        Point from = (u ? segs[i].second : segs[i].first);
        Point to = (v ? segs[j].second : segs[j].first);
        Segment seg{from, to};
        bool ok = true;
        REP(k, n) {
            if (k != i && k != j && cross(seg, segs[k])) {
                ok = false;
                break;
            }
        }
        if (ok) {
            di[2 * i + u][2 * j + v] = dist(from, to);
        }
    }
    DBG(di);
    REP(k, 2 * n) REP(i, 2 * n) REP(j, 2 * n) {
        chmin(di[i][j], di[i][k] + di[k][j]);
    }
    REP(qi, m) {
        i32 a, b, c, d;
        cin >> a >> b >> c >> d;
        --a;
        --b;
        --c;
        --d;
        cout << di[2 * a + b][2 * c + d] << '\n';
    }
}