题目描述
The problem statement is very simple.You are given two co-ordinates points on a infinite 2D plane.
Your task is to find total number of integral points lying between given co-ordinates.
Input
The first line contains a single integer T, the number of test cases. T lines follow.
Each of the following T lines contains one test case each. Each test case contains 4 integers x1, y1, x2 and y2 separated by a single space.
Output
A single line containing the number of steps.
Constraints
1 ≤ T ≤ 105
-10^9 ≤ x1, y1, x2, y2 ≤ 10^9
Problem Setter : KVNT
SAMPLE INPUT
3
4 0 0 2
5 5 2 2
8 16 1 9
SAMPLE OUTPUT
1
2
6
输入格式
见题面
输出格式
见题面
样例输入
10
-5 4 -3 -2
10 100 0 -8
78 89 7 2
-10 0 0 0
-1000 -1000 1000 1000
5 9 3 2
15 48 78 49
-2 -2 -2 -2
1 1 1 1
2 -5 4 -5
样例输出
0
0
0
0
2
87
199999
199999
1499999
1499999