#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int INF=1000000;
int main(){
	int y,m,d;
	while(cin>>y>>m>>d){
		if(y<=1868&&m<=9&&d<8) cout<<"pre-meiji"<<endl;
		else if(y<=1912&&m<=7&&d<29){
			cout<<"meiji "<<y-1868+1<<" "<<m<<" "<<d<<endl;
		}
		else if(y<=1926&&m<=12&&d<24){
			cout<<"taisho "<<y-1912+1<<" "<<m<<" "<<d<<endl;
		}
		else if(y<=1989&&m<=1&&d<8){
			cout<<"showa "<<y-1989+1<<" "<<m<<" "<<d<<endl;
		}
		else{
			cout<<"heisei "<<y-1989+1<<" "<<m<<" "<<d<<endl;
		}
	}
}