#include<iostream>
#include<deque>
using namespace std;

struct node{
	int x,y,z;
};

int main()
{
	deque<node> q;
	//ͷ
	for(int i=1;i<=5;i++){
		q.push_front({i,i*2,i*3});
	}	
	//ͷɾ
	while(q.size()){
		auto tmp=q.front();
		q.pop_front();
		cout<<tmp.x<<" "<<tmp.y<<" "<<tmp.z<<endl;
	}
	//β
	for(int i=1;i<=5;i++){
		q.push_back({i,i*2,i*3});
	}	
	//βɾ
	while(q.size()){
		auto tmp=q.back();
		q.pop_back();
		cout<<tmp.x<<" "<<tmp.y<<" "<<tmp.z<<endl;
	} 
	return 0;
}