[Solution] Everyone Loves to Sleep Codeforces Solution

A. Everyone Loves to Sleep

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vlad, like everyone else, loves to sleep very much.

Every day Vlad has to do n$n$ things, each at a certain time. For each of these things, he has an alarm clock set, the i$i$-th of them is triggered on hi$h_i$ hours mi$m_i$ minutes every day (0≤hi<24,0≤mi<60$0\le h_i<24,0\le m_i<60$). Vlad uses the 24$24$-hour time format, so after h=12,m=59$h=12,m=59$ comes h=13,m=0$h=13,m=0$ and after h=23,m=59$h=23,m=59$ comes h=0,m=0$h=0,m=0$.

This time Vlad went to bed at H$H$ hours M$M$ minutes (0≤H<24,0≤M<60$0\le H<24,0\le M<60$) and asks you to answer: how much he will be able to sleep until the next alarm clock.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 occupied

If any alarm clock rings at the time when he went to bed, then he will sleep for a period of time of length 0$0$.

Input

The first line of input data contains an integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases in the test.

The first line of the case contains three integers n$n$, H$H$ and M$M$ (1≤n≤10,0≤H<24,0≤M<60$1\le n\le 10,0\le H<24,0\le M<60$) — the number of alarms and the time Vlad went to bed.

The following n$n$ lines contain two numbers each hi$h_i$ and mi$m_i$ (0≤hi<24,0≤mi<60$0\le h_i<24,0\le m_i<60$) — the time of the i$i$ alarm. It is acceptable that two or more alarms will trigger at the same time.

Numbers describing time do not contain leading zeros.

Output

Output t$t$ lines, each containing the answer to the corresponding test case. As an answer, output two numbers  — the number of hours and minutes that Vlad will sleep, respectively. If any alarm clock rings at the time when he went to bed, the answer will be 0 0.