#include namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, t; cin >> n >> t; struct S { int a, b, r; }; vector abr(n); for (auto& [a, b, r] : abr) cin >> r; for (auto& [a, b, r] : abr) cin >> a >> b; ranges::sort(abr, {}, [](S x) { auto [a, b, r] = x; if (a <= b) return P{0, a}; else return P{1, -b}; }); ll add = 0; ll sa = 0, sb = 0; rep(i, n) { auto [a, b, r] = abr[i]; // sa+a <= add+sb // sa+ra <= add+sb+(r-1)b chmax(add, sa + a - sb); chmax(add, sa + (ll)r * a - sb - ll(r - 1) * b); sa += (ll)r * a, sb += (ll)r * b; if (i + 1 < n) sa += t, sb += t; } ll ans = add + sb; cout << ans / (24 * 60) << ' ' << ans / 60 % 24 << ' ' << ans % 60 << '\n'; }