#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int day, h, m;
  cin >> day >> h >> m;
  --day;
  int t = m + h * 60 + day * 24 * 60;
  vector<int> kek;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> day >> h >> m;
    if (day == 0) {
      int w = h * 60 + m;
      for (int j = 0; j < 7; ++j) {
        kek.push_back(w);
        w += 24 * 60;
      }
    } else {
      --day;
      int w = m + h * 60 + day * 24 * 60;
      kek.push_back(w);
    }
  }
  sort(kek.begin(), kek.end());
  auto it = lower_bound(kek.begin(), kek.end(), t) - kek.begin();
  int x = kek[it];
  day = x / 24 / 60;
  x %= 24 * 60;
  h = x / 60;
  x %= 60;
  m = x;
  ++day;
  cout << day << ' ' << h << ' ' << m << '\n';
}