|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||1||1||1||100.000%|
There are so many natural wonders in the Bytelandia States Union (BSU)! But the most mysterious wonder is, undoubtedly, the Murbeda Rectangle. Here time and space behave in a rather unusual way. Bytelandian scientists still haven't found a reason why such anomalies occur, even after many years of research. Luckily, they managed to understand how physics works at the Murbeda Rectangle.
Consider the Murbeda Rectangle as a large rectangle. The scientists have divided the rectangle into a grid of $2 \cdot 10^9 \times 2 \cdot 10^9$ small squares. Each square has coordinates $(x, y)$, where the $x$-axis goes from north to south, and the $y$-axis goes from west to east. So, the northwestern square is at $(1, 1)$, and the southeastern square is at $(2 \cdot 10^9, 2 \cdot 10^9)$. There is a portal in the square $(x_2, y_2)$ which is the only way to connect the Murbeda Rectangle to the outer world.
Suppose you are in the square $(x, y)$ of the rectangle. You can move in one of four directions (north, south, east, or west), thus increasing or decreasing one of the coordinates by one. You cannot go out of the rectangle: for instance, you cannot go south from the square $(2\cdot 10^9, 42)$ or go west from the square $(42, 1)$. If you do, you may fall into a deep canyon filled with poisonous snakes.
The most fascinating thing is the amount of time you spend on moving in some direction. If you are in the square $(x, y)$, then:
The amount of time spent on moving between squares may even be negative! The place is really special.
The scientists intend to rescue $n$ people from the Murbeda Rectangle. For a person who stands in the square $(x_1, y_1)$, they need to determine the minimum time needed to reach the portal. One can prove that such a minimal amount of time exists, so no one can reach an infinitely small moment by walking around.
Since the place is extremely unusual, each of the $n$ persons may require a different portal.
The first line contains an integer $n$, the number of people to rescue ($1 \le n \le 5 \cdot 10^4$).
Each of the following $n$ lines contains four integers $x_1$, $y_1$, $x_2$, $y_2$, denoting the location of the $i$-th person and the location of their rescue portal ($1 \le x_1, y_1, x_2, y_2 \le 10^9$).
Print $n$ lines. The $i$-th line should contain the minimal amount of time in seconds for the $i$-th person to reach their rescue portal. Since this amount can be pretty large, print it modulo $998\,244\,353$.
4 1 1 1 1 1 3 2 1 2 1 1 3 10 2 20 6
0 12 17 16999