#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> adj(n);
    //DAG
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
    }
    for(int i = 0; i < n; i++) {
        if(adj[i].size() > 0) {
            sort(adj[i].begin(), adj[i].end());
            cout << i << ":";
            for(auto [v, w] : adj[i]) {
                cout << "(" << i << "," << v << "," << w << ")";
            }
            cout << endl;
        }
    }
    return 0;
}