Chef had constructed 2 buildings - one of height N and another of height M.
He was unhappy, and wanted both buildings to be of the same height.
In one move, he could either add a floor to a building, or remove a floor from a building.
Help him find the minimum number of moves to make the heights equal.

Input
First line contains a positive integer T - the total number of testcases.
T lines follow, each representing a test case.
Each line contains 2 space-separated positive integers - N and M.

Output
For each testcase, print the minimum number of moves on a new line.

Constraints
1 ≤ T ≤ 10^5
1 ≤ N, M ≤ 10^18

Subtasks

Subtask #1 (20 points)
1 ≤ T ≤ 10^5
1 ≤ N, M ≤ 10^9
Subtask #2 (80 points)
1 ≤ T ≤ 10^5
1 ≤ N, M ≤ 10^18

Sample Testcase
Sample Input

1
2 3

Sample Output

1

见题面

见题面