Berland traffic is very different from traffic in other countries. The capital of Berland consists of n junctions and m roads. Each road connects a pair of junctions. There can be multiple roads between a pair of junctions. For each road we know its capacity: value ci is the maximum number of cars that can drive along a road in any direction per a unit of time. For each road, the cars can drive along it in one of two direction. That it, the cars can't simultaneously move in both directions. A road's traffic is the number of cars that goes along it per a unit of time. For road (ai, bi) this value is negative, if the traffic moves from bi to ai. A road's traffic can be a non-integer number.

The capital has two special junctions — the entrance to the city (junction 1) and the exit from the city (junction n). For all other junctions it is true that the traffic is not lost there. That is, for all junctions except for 1 and n the incoming traffic sum equals the outgoing traffic sum.

Traffic has an unusual peculiarity in the capital of Berland — for any pair of junctions (x, y) the sum of traffics along any path from x to y doesn't change depending on the choice of the path. Such sum includes traffic along all roads on the path (possible with the "minus" sign, if the traffic along the road is directed against the direction of the road on the path from x to y).

Your task is to find the largest traffic that can pass trough the city per one unit of time as well as the corresponding traffic for each road. 

Input

The first line contains a positive integer n — the number of junctions (2 ≤ n ≤ 100). The second line contains integer m (1 ≤ m ≤ 5000) — the number of roads. Next m lines contain the roads' descriptions. Each road contains a group of three numbers ai, bi, ci, where ai, bi are the numbers of junctions, connected by the given road, and ci (1 ≤ ai, bi ≤ n; ai ≠ bi; 0 ≤ ci ≤ 10000) is the largest permissible traffic along this road.

Output

In the first line print the required largest traffic across the city. Then print m lines, on each line print the speed, at which the traffic moves along the corresponding road. If the direction doesn't match the order of the junctions, given in the input, then print the traffic with the minus sign. Print the numbers with accuracy of at least five digits after the decimal point.

If there are many optimal solutions, print any of them.

Examples

Input

2
3
1 2 2
1 2 4
2 1 1000


Output

6.00000
2.00000
2.00000
-2.00000


Input

7
11
1 2 7
1 2 7
1 3 7
1 4 7
2 3 7
2 5 7
3 6 7
4 7 7
5 4 7
5 6 7
6 7 7


Output

13.00000
2.00000
2.00000
3.00000
6.00000
1.00000
3.00000
4.00000
7.00000
1.00000
2.00000
6.00000
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5, E = 5e3 + 5;
const double eps = 1e-9;
int link[N][N], X[E], Y[E], W[E];
int dad[N], n, m;
int M[N][N];
double S[N][N];
int find(int u) { return u == dad[u] ? u : dad[u] = find(dad[u]); }
void merge(int x, int y) {
  int fx = find(x), fy = find(y);
  if (fx != fy) dad[fx] = fy;
}
void Gauss() {
  int i, j, k, x, y, pos;
  double t, Sax;
  for (x = y = 1; x <= n; x++) {
    pos = x;
    for (Sax = 0, i = x; i <= n; i++)
      if ((t = fabs(S[i][x])) > Sax) pos = i, Sax = t;
    if (pos != x)
      for (i = x; i <= n + 1; i++) swap(S[pos][i], S[x][i]);
    if (fabs(S[x][x]) < eps) continue;
    for (i = 1; i <= n; i++) {
      if (i == x) continue;
      t = S[i][x] / S[x][x];
      for (j = x; j <= n + 1; j++) S[i][j] -= t * S[x][j];
    }
  }
  for (i = 1; i <= n; i++)
    if (fabs(S[i][i]) > eps)
      S[i][n + 1] /= S[i][i];
    else
      S[i][n + 1] = 0;
}
int main() {
  int i, j, k, x, y;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) dad[i] = i;
  for (i = 1; i <= m; i++) {
    scanf("%d%d%d", X + i, Y + i, W + i);
    merge(X[i], Y[i]);
    M[X[i]][Y[i]]--;
    M[Y[i]][X[i]]--;
    M[X[i]][X[i]]++;
    M[Y[i]][Y[i]]++;
  }
  if (find(1) != find(n)) {
    for (i = 0; i <= m; i++) printf("%.10lf\n", 0);
    return 0;
  }
  for (i = 1; i <= n; i++) M[1][i] = 0, M[n][i] = 0;
  M[1][1] = 1;
  M[n][n] = M[n][n + 1] = 1;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n + 1; j++) {
      S[i][j] = M[i][j];
    }
  }
  Gauss();
  double lim = 1e50, t, inf = 1e50, Ans = 0;
  for (i = 1; i <= m; i++)
    lim =
        min(lim,
            (t = fabs(S[Y[i]][n + 1] - S[X[i]][n + 1])) < eps ? inf : W[i] / t);
  for (i = 1; i <= n; i++) S[i][n + 1] *= lim;
  for (i = 1; i <= m; i++)
    if (X[i] == 1 || Y[i] == 1) Ans += fabs(S[X[i] ^ Y[i] ^ 1][n + 1]);
  printf("%.10lf\n", Ans);
  for (i = 1; i <= m; i++) {
    printf("%.10lf\n", S[Y[i]][n + 1] - S[X[i]][n + 1]);
  }
}
