#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
struct node {
int from,to,dis,next;
};
vector<node> g[N];
int head[N];
node edge[N];
int ei;
int n,m;
void add(int from,int to ,int dis) {
edge[ei].from=from;
edge[ei].to=to;
edge[ei].dis=dis;
edge[ei].next=head[from];
head[from]=ei;
}
int main() {
cin>>n>>m;
for(int i=1; i<=m; i) {
int u,v,w;
cin>>u>>v>>w;
add(u,v,w);
}
for(int i=1; i<=n; i++) {
cout<<"check"<<i<<endl;
for(int j=head[i]; j!=0; j=edge[j].next) {
int u=edge[j].from,v=edge[j].to,w=edge[j].dis;
printf("(%d,%d,%d)\n",u,v,w);
}
}
return 0;
}
/*
7 12
1 2 1
1 3 3
1 4 2
2 4 1
2 5 2
3 6 1
4 3 3
4 2 6
4 7 1
5 4 1
5 7 2
7 6 1
*/
