struct

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
struct rubbish{
	int t; int l; int h;
	bool operator < (const rubbish& b) const{
        return t< b.t;  
    }
	rubbish(): l(),t(),h(){	}
	rubbish(int a,int b,int c): t(a),l(b),h(c){	}
	#define t(x) r[x].t
	#define l(x) r[x].l
	#define h(x) r[x].h
}r[101]; 
int dp[126],d,n;
int main(){
	cin>>d>>n;
	for(int i=1;i<=n;i++){
		int a,b,c;
		cin>>a>>b>>c;
		r[i]=rubbish(a,b,c);
	}
	sort(r+1,r+1+n);
	for (int i=1;i<=n;i++) cout<<t(i)<<" "<<l(i)<<" "<<h(i)<<endl; 
	return 0;
}