시간 제한 | 메모리 제한 | 제출 | 정답 | 맞은 사람 | 정답 비율 |
---|---|---|---|---|---|

3 초 | 256 MB | 12 | 7 | 7 | 70.000% |

The beautiful city of Leiden draws more and more tourists every year. Opposite the famous Hilbert Hotel, located near the city border, a competing chain is building a hotel in a project nicknamed Lodgings In A Colossal Skyscraper (LIACS). As you may know, the Hilbert Hotel has an infinite number of rooms. Guests at the Hilbert have been complaining that it takes them forever to reach their room, so the competing hotel chain decided that LIACS will only have finitely many rooms. Nevertheless, LIACS will become a colossal skyscraper consisting of many many floors, precisely F of them.

The floors will be connected by both elevators and stairways. Fire regulations demand that it must be possible to reach the ground floor using only the stairs, so there is a stairway going from the top floor all the way down to the ground floor (with a door on every floor in between). On the other hand, the elevators can only pick up people on so many floors before they are full, so the project manager decided that no elevator should stop on every floor. More precisely, the i-th elevator will only stop on floors for which the number is equivalent to R_{i} modulo M_{i}.

The guests don’t mind taking the elevator or changing elevators many times in a row, but they don’t like taking the stairs. The LIACS project manager has no idea whether his planned elevators provide acceptable coverage, so he asked you to calculate how many flights of stairs his guests have to take in order to get to their room, assuming that their room is situated on the worst possible floor. Guests always enter the hotel on the ground floor. Note that guests may alternately take the stairs and take the elevators in order to reach their room, as not every elevator stops at the ground floor. (See sample input below.)

The input starts with a line containing an integer T, the number of test cases. Then for each test case:

- One line with two space-separated integers F and E, denoting the number of floors and elevators, respectively. These satisfy 2 ≤ F ≤ 109 and 0 ≤ E ≤ 100. The floors are numbered from 0 to F − 1, where 0 is the ground floor and F − 1 is the top floor. (This is quite common in the Netherlands, whereas in other countries the ground floor is sometimes numbered 1 instead of 0.)
- E lines, each containing two space-separated integers R
_{i}and M_{i}satisfying 2 ≤ M_{i}≤ F and 0 ≤ R_{i}< Mi. These denote the remainder and the modulus for every elevator. It is guaranteed that every elevator stops on at least 1 and at most 1,000 floors.

For each test case, output one line with two integers S and W separated by a single space, where

- S is the number of stairs a guest has to take if his room is located on the worst possible floor,
- W is the number of the worst possible floor. If multiple floors are equally bad, output the one closest to the ground floor.

5 21 3 0 3 1 3 2 3 21 2 0 3 1 3 15 2 2 3 1 4 10 0 99 3 0 2 1 2 0 3

1 1 2 20 2 3 9 9 0 0

In the second test case, the top floor is numbered 20. The closest elevator is the one on the nineteenth floor, but this one doesn’t stop at the ground floor. Thus, a guest sleeping at the twentieth floor needs to walk at least two flights of stairs. (On the other hand, in the first test case one can take the elevator from the ground floor to the third floor, then walk to the second floor and take the elevator to the twentieth floor.)