A. Robot Cleaner

Problem Statement

A robot cleaner is placed on the floor of a rectangle room, surrounded by walls. The floor consists of n rows and m columns. The rows of the floor are numbered from 1 to n from top to bottom, and columns of the floor are numbered from 1 to m from left to right. The cell on the intersection of the r-th row and the c-th column is denoted as (r,c). The initial position of the robot is (rb,cb).

In one second, the robot moves by dr rows and dc columns, that is, after one second, the robot moves from the cell (r,c) to (r+dr,c+dc). Initially dr=1, dc=1. If there is a vertical wall (the left or the right walls) in the movement direction, dc is reflected before the movement, so the new value of dc is −dc. And if there is a horizontal wall (the upper or lower walls), dr is reflected before the movement, so the new value of dr is −dr.

Each second (including the moment before the robot starts moving), the robot cleans every cell lying in the same row or the same column as its position. There is only one dirty cell at (rd,cd). The job of the robot is to clean that dirty cell.

cleans a row and a column, denoted by yellow stripes.
Given the floor size n and m, the robot’s initial position (rb,cb) and the dirty cell’s position (rd,cd), find the time for the robot to do its job.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤104). Description of the test cases follows.

A test case consists of only one line, containing six integers n, m, rb, cb, rd, and cd (1≤n,m≤100, 1≤rb,rd≤n, 1≤cb,cd≤m) — the sizes of the room, the initial position of the robot and the position of the dirt cell.

Output

For each test case, print an integer — the time for the robot to clean the dirty cell. We can show that the robot always cleans the dirty cell eventually.

Example

input

5
10 10 6 1 2 8
10 10 9 9 1 1
9 8 5 6 2 1
6 9 2 2 5 8
2 2 1 1 2 1

output

7
10
9
3
0

C++代码

#include<bits/stdc++.h>
using namespace std;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int tt;
	cin >> tt;
	
	while(tt --){
		int n, m, rb, cb, rd, cd;
		cin >> n >> m >> rb >> cb >> rd >> cd;
		int dr = 1, dc = 1, ans = 0;
		while(rb != rd && cb != cd){
			if((rb == n && dr > 0) || (rb == 1 && dr < 0))dr = -dr;
			rb += dr;
			if((cb == m && dc > 0) || (cb == 1 && dc < 0))dc = -dc;
			cb += dc;
			ans ++;
		}
		cout << ans << '\n';
	}
 
	return 0;
}