#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>

using namespace std;

struct Edge {
    int from = 0, to = 0, c = 0;
    Edge() = default;
    Edge(int a, int b, int c_) {
        from = a;
        to = b;
        c = c_;
    }
};

int INF = 1000000001;
int n, m;
vector<vector<int>> ans;
vector<Edge> edges;
vector<int> ind[501];
vector<int> path;
vector<bool> used;

int dfs(int v, int f) {
    if (f <= 0) {
        return 0;
    }
    if (v == n) {
        path.push_back(f);
        ans.push_back(path);
        return f;
    }
    used[v] = true;
    for (int e : ind[v]) {
        if (edges[e].c > 0 && !used[edges[e].to]) {
            path.push_back(e >> 1);
            int tempf = dfs(edges[e].to, min(f, edges[e].c));
            if (tempf) {
                edges[e].c -= tempf;
                edges[e ^ 1].c += tempf;
                return tempf;
            }
            path.pop_back();
        }
    }
    return 0;
}

void find_decomposition() {
    int curf = dfs(1, INF);
    while (curf > 0) {
        path.clear();
        fill(used.begin(), used.end(), false);
        curf = dfs(1, INF);
    }
    cout << ans.size() << "\n";
    for (auto & an : ans) {
        cout << an.back() << " " << an.size() - 1 << " ";
        for (int j = 0; j < an.size() - 1; ++j) {
            cout << an[j] + 1 << " ";
        }
        cout << "\n";
    }
}

int main() {

    cin >> n >> m;
    used.resize(n + 1);

    for (int i = 0; i < m; ++i) {
        int from, to, cap;
        cin >> from >> to >> cap;
        edges.emplace_back(from, to, cap);
        ind[from].push_back(i << 1);
        edges.emplace_back(to, from, -cap);
        ind[to].push_back((i << 1) + 1);
    }

    find_decomposition();

    return 0;
}