2 2
1 2 1 4 2 4
1 2 3 4 4 4
 2 2
1 2 0 9998 0 9999
2 1 0 9999 0 10000
 3 3
1 2 0 3 -4 7
2 3 -2 5 1 6
3 1 0 4 0 4
 2 2
1 2 0 3 0 3
2 1 0 4 0 4
 2 2
1 2 0 0 0 0
2 1 0 0 0 0
 5 10
4 3 -19 49 -11 65
4 4 50 12 -2 65
1 5 56 8 -5 76
5 1 -28 33 -38 49
4 2 0 0 2 9
4 2 0 0 14 8
3 1 26 67 15 85
5 3 -51 98 -44 99
1 3 -33 65 -20 65
3 4 30 6 -30 70
 5 10
4 3 -8 16 -29 72
4 4 -62 65 33 65
1 5 -58 97 -17 97
5 1 -5 10 -68 88
4 2 0 0 -9 60
4 2 0 0 -23 39
3 1 3 28 13 87
5 3 -1 25 -15 90
1 3 -12 33 6 94
3 4 -71 86 -39 86
 5 10
4 3 -1 5 -6 98
4 4 12 14 -43 98
1 5 -4 6 8 88
5 1 0 0 -9 100
4 2 0 0 6 50
4 2 0 0 -39 77
3 1 1 4 -1 100
5 3 -7 13 9 88
1 3 2 0 -7 100
3 4 2 0 3 88
 2 2
1 1 0 4 0 5
2 2 4 0 5 0
 2 2
1 2 0 4 0 4
2 1 0 4 0 4
 2 2
1 2 0 3 0 5
2 1 0 4 0 6

0
 1.0000000000
 0.2500000000
 0
 1.0000000000
 0.2121212000
 0.6666666000
 1.0000000000
 1.0000000000
 1.0000000000
 1.0000000000

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const long long inf = 1e18;
vector<int> Eid[N];
int n, m, cnt, S, T, in[N], out[N], cur[N];
long long d[N];
struct Edge {
  long long c;
  int v;
} E[N];
void AddEdge(int x, int y, long long c) {
  E[cnt].v = y, E[cnt].c = c;
  Eid[x].push_back(cnt++);
  E[cnt].v = x, E[cnt].c = 0;
  Eid[y].push_back(cnt++);
}
bool BFS() {
  static int Q[N];
  int x, ql, qr;
  for (int i = 0; i <= T; i++) d[i] = -1;
  Q[ql = qr = 0] = S;
  d[S] = 0;
  while (ql <= qr) {
    x = Q[ql++];
    for (int i = 0; i < Eid[x].size(); i++) {
      const Edge &e = E[Eid[x][i]];
      if (e.c && d[e.v] == -1) {
        Q[++qr] = e.v;
        d[e.v] = d[x] + 1;
        if (e.v == T) return 1;
      }
    }
  }
  return 0;
}
long long Aug(int x, long long a) {
  if (x == T) return a;
  long long aug = 0, delta;
  for (int &i = cur[x]; i < Eid[x].size(); i++) {
    Edge &e = E[Eid[x][i]];
    if (e.c && d[e.v] == d[x] + 1) {
      delta = Aug(e.v, min(a, e.c));
      if (delta) {
        e.c -= delta;
        E[Eid[x][i] ^ 1].c += delta;
        aug += delta;
        if (!(a -= delta)) break;
      }
    }
  }
  if (!aug) d[x] = -1;
  return aug;
}
long long MaxFlow() {
  long long flow = 0;
  while (BFS()) {
    for (int i = 0; i <= T; i++) cur[i] = 0;
    flow += Aug(S, inf);
  }
  return flow;
}
int id[N];
int u[N], v[N];
long long A[N], B[N], C[N], D[N];
long long check(int t) {
  long long ans = 0;
  for (int i = 1; i <= m; ++i) {
    for (int j = id[i]; j < id[i] + 6; ++j) E[j].c = 0;
    long long l = A[i] * t + B[i];
    long long r = C[i] * t + D[i];
    E[id[i]].c = E[id[i] + 2].c = l;
    E[id[i] + 4].c = r - l;
    ans += l;
  }
  return ans - MaxFlow();
}
int main() {
  cin >> n >> m;
  T = n + 1;
  for (int i = 1; i <= m; ++i) {
    scanf("%d %d %I64d %I64d %I64d %I64d", u + i, v + i, A + i, B + i, C + i,
          D + i);
    B[i] *= 1e8;
    D[i] *= 1e8;
    id[i] = cnt;
    AddEdge(S, v[i], 0);
    AddEdge(u[i], T, 0);
    AddEdge(u[i], v[i], 0);
  }
  long long l1, r1, l = 0, r = 1e8, mid;
  while (r - l > 6) {
    l1 = (r - l) / 3 + l;
    r1 = r - (r - l) / 3;
    if (check(l1) <= check(r1))
      r = r1;
    else
      l = l1;
  }
  long long tmp = check(l1), tmp1;
  for (int i = l1; i <= r1; ++i) {
    tmp1 = check(i);
    if (tmp1 < tmp) {
      l1 = i;
      tmp = tmp1;
    }
  }
  if (tmp) return puts("0");
  l = l1;
  r = 1e8;
  while (l < r) {
    if (l + 1 == r) {
      if (check(r) == 0)
        l++;
      else
        r--;
      break;
    }
    mid = l + r >> 1;
    if (check(mid) == 0)
      l = mid;
    else
      r = mid;
  }
  printf("%.10f\n", (l - l1 + 1) / 1e8);
}
