Planet Lapituletti
Contest: Codeforces Round 705 (Div. 2)
Difficulty rating: 1300
Tags: brute force, implementation

The time on the planet Lapituletti goes the same way it goes on Earth but a day lasts $$$h$$$ hours and each hour lasts $$$m$$$ minutes. The inhabitants of that planet use digital clocks similar to earth ones. Clocks display time in a format HH:MM (the number of hours in decimal is displayed first, then (after the colon) follows the number of minutes in decimal; the number of minutes and hours is written with leading zeros if needed to form a two-digit number). Hours are numbered from $$$0$$$ to $$$h-1$$$ and minutes are numbered from $$$0$$$ to $$$m-1$$$.

That's how the digits are displayed on the clock. Please note that digit $$$1$$$ is placed in the middle of its position.

A standard mirror is in use on the planet Lapituletti. Inhabitants often look at the reflection of the digital clocks in the mirror and feel happy when what you see on the reflected clocks is a valid time (that means that you see valid digits in the reflection and this time can be seen on the normal clocks at some moment of a day).

The image of the clocks in the mirror is reflected against a vertical axis.

The reflection is not a valid time.The reflection is a valid time with $$$h=24$$$, $$$m = 60$$$. However, for example, if $$$h=10$$$, $$$m=60$$$, then the reflection is not a valid time.

An inhabitant of the planet Lapituletti begins to look at a mirrored image of the clocks at some time moment $$$s$$$ and wants to know the nearest future time moment (which can possibly happen on the next day), when the reflected clock time is valid.

It can be shown that with any $$$h$$$, $$$m$$$, $$$s$$$ such a moment exists. If the reflected time is correct at the moment the inhabitant began to look at the clock, that moment is considered the nearest.

You are asked to solve the problem for several test cases.

Input format:
The first line contains a single integer $$$T$$$ ($$$1 \le T \le 100$$$) — the number of test cases.

The next $$$2 \cdot T$$$ lines contain the description of test cases. The description of each test case consists of two lines.

The first line of a test case contains two integers $$$h$$$, $$$m$$$ ($$$1 \le h, m \le 100$$$).

The second line contains the start time $$$s$$$ in the described format HH:MM.

Output format:
For each test case output in a separate line the nearest moment in format HH:MM when the reflected time is correct.

Constraints:
Time limit: 2.0 s
Memory limit: 256.0 MB

Note:
In the second test case it is not hard to show that the reflection of 23:59 is incorrect, while the reflection of the moment 00:00 on the next day is correct.

Example input:
5
24 60
12:21
24 60
23:59
90 80
52:26
1 100
00:01
10 10
04:04

Example output:
12:21
00:00
52:28
00:00
00:00

Editorial:
In order to solve the problem, you need to look over all the moments of time after the given one and check if the reflected time is correct in that moment of time. If such moment of time does not exist on the current day, the moment $$$00:00$$$ of the next day is always correct.
For realization you need to notice that digits $$$0$$$, $$$1$$$, $$$8$$$ transform into themselves after reflection, $$$2$$$ transforms into $$$5$$$, $$$5$$$ transforms into $$$2$$$, and other digits ($$$3$$$, $$$4$$$, $$$6$$$, $$$7$$$, $$$9$$$) transform into incorrect digits after reflection.