Cocktail With Snake

题号：NC222156
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

The favorite game of Mr.Cocktail is dota2. Serpentine walking is a useful skill to dodge the enemy's attack. Serpentine walking refers to the path of movement that keeps swing direction like a snake. Suppose the map is a ${N \times M}$ two-dimensional plane. Mr.Cocktail at the point ${(1,1)}$ in initial.

He will first go to the right to the end, that is, point ${(N,1)}$ . Then turn and go one step upwards to point ${(N,2)}$ . Go to the left again to the end, that is, point ${(1,2)}$ ,. Then go one step up, and go to the right again to the end.

The picture above is the action line when ${N=3}$ and ${M=4}$ .

Now the map size is ${N \times M}$ . The number of steps ${k}$ of Cocktail's movement are known. Find the Manhattan distance from the position after ${k}$ steps to the starting point according to the rule.

Manhattan distance Definition: The distance between two points measured along axes at right angles. In a plane with ${p_1}$ at ${(x_1, y_1)}$ and $p_2$ at ${(x_2, y_2)}$ , it is $|x_1 - x_2| + |y_1 - y_2|$ .

输入描述:

The first line contains a positive integer , which represents the number of groups to be tested. 

Next contains  lines, each row contains three integers

输出描述:

For each test data, output a line of one coordinate to represent the answer. (A positive integer separated by two spaces represents the  and  coordinates respectively)

示例1

输入

复制

输出

复制