Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

//ConvReiwa ..
func ConvReiwa(sd []string) []string {
	var ne []string
	yr, _ := strconv.Atoi(sd[1])
	mn, _ := strconv.Atoi(sd[2])

	switch {
	case yr < 31:
		return sd
	case yr == 31 && mn < 5:
		return sd
	default:
		ne = append(ne, "?")
		ne = append(ne, strconv.Itoa(yr-30))
		ne = append(ne, sd[2])
		ne = append(ne, sd[3])
		return ne
	}
}

func main() {

	for sc.Scan() {

		str := sc.Text()

		if str == "#" {
			break
		}

		sdt := strings.Split(str, " ")
		ans := ConvReiwa(sdt)

		fmt.Printf("%s %s %s %s\n", ans[0], ans[1], ans[2], ans[3])
	}

}

C++: //#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
//const ll mod = 1000000000 + 7;
const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

//debug
#define DEBUG

#define DUMPOUT cout

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}



signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  while (true) {
    vector<string> s(4);
    rep(i, 4) {
      cin >> s[i];
      if (s[i] == "#") return 0;
    }
    int tmp = stoi(s[1]);
    if (tmp > 31) {
      int ans = tmp - 31 + 1;
      cout << "? " << ans << " " << s[2] <<  " " << s[3] << endl;
    }
    else if (tmp == 31) {
      int tmp1 = stoi(s[2]);
      if (tmp1 >= 5) {
        cout << "? " << 1 << " " << s[2] << " " << s[3] << endl;
      }
      else {
        cout << s[0] << " " << s[1] << " " << s[2] << " " << s[3] << endl;
      }
    }
    else {
      cout << s[0] << " " << s[1] << " " << s[2] << " " << s[3] << endl;
    }
  }
}

C++: #include<bits/stdc++.h>

using namespace std;

int main(){
  
  string g;
  int y,m,d;
  
  while(1){
	cin >> g >> y >> m >> d;
	
	if(g == "#")
	  break;
	
    if(y > 31 || (y == 31 and m > 4))
	  printf("? %d %d %d\n",y-30,m,d);
	else
	  printf("HEISEI %d %d %d\n",y,m,d);
  }
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
    string s;
    while(cin >> s, s != "#"){
        int y,m,d;
        cin >> y >> m >> d;
        if(y > 31 || (y == 31 && m > 4)){
            cout << "? " << y-30 << " " << m << " " << d << endl;
        }else{
            cout << s << " " << y << " " << m << " " << d << endl;
        }
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

void solve(int a, int b, int c){
	if(a <= 30){
		cout << "HEISEI " << a << " " << b << " " << c << "\n";
	}else if(a == 31){
		if(b <= 4){
			cout << "HEISEI " << a << " " << b << " " << c << "\n";
		}else{
			cout << "? " << 1 << " " << b << " " << c << "\n";
		}
	}else{
		cout << "? " << a-30 << " " << b << " " << c << "\n";
	}
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	while(1){
		string s;
		cin >> s;
		if(s == "#") return 0;
		int a, b, c;
		cin >> a >> b >> c;
		solve(a, b, c);
	}
}