Magic Clock (Basic)

Scientists from Piltover obtained a very mysterious magic clock. The strange movement of its hands made them suspect that important information may be encrypted in it.

The clock has a dial of $60 \cdot 12 = 720$ divisions, numbered from $0$ to $719$ clockwise, plus a minute hand and an hour hand. Every minute, the minute hand moves 12 divisions and the hour hand moves 1. So on an ordinary clock, in one hour (60 minutes), the minute hand goes around the full dial once, and the hour hand moves $\frac{1}{12}$ of the circle.

The clock is unusual in one way. When on some tick the minute hand must overtake or catch up with the hour hand, it teleports to the start. Specifically, if the minute hand points to division $m$ and the hour hand points to $h$, and the distance between them is $d = (h - m) \bmod 720$ divisions, then if $0 < d < 12$, at the end of the next minute the minute hand is at division $0$. The hour hand keeps moving normally.

Heimerdinger proposed $q$ theories about the nature and abilities of such clocks. To check the $i$-th theory, you must find how many minutes it takes for the hands to go from state $s_{i,1}$ to state $s_{i,2}$.

The first line contains a single integer $q$, the number of queries ($1 \leqslant q \leqslant 2000$). Each of the next $q$ lines contains four integers $h_1$, $m_1$, $h_2$, and $m_2$, separated by spaces. They are the divisions that the hour and minute hands point to in the initial and final states, respectively ($0 \leqslant h_{1,2}, m_{1,2} < 720$).

Print $q$ lines, one answer per query. The answer is the minimum number of minutes after which the clock goes from state $(h_1, m_1)$ to state $(h_2, m_2)$, or -1 if the clock never reaches the second state when starting from the first.