#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(o) {cerr<<#o<<" "<<o<<endl;}
#define DUMPC(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	int a[5] = { 18680908,19120730,19261225,19890108,INF };
	string b[5] = { "pre-meiji","meiji","taisho","showa","heisei" };
	for (int y, m, d; cin >> y >> m >> d;) {
		int c = y * 10000 + m * 100 + d;
		REP(i, 5) {
			if (a[i] > c) {
				if (i == 0)cout << b[0] << endl;
				else cout << b[i] << " " << (y - a[i - 1] / 10000) + 1 << " " << m << " " << d << endl;
				break;
			}
		}
	}
	return 0;
}