#codeforcesP2009A. Minimize!

Minimize!

Problem

You are given two integers aa and bb (ab)(a≤b ). Over all possible integer values of c(acb)c(a≤c≤b), find the minimum value of (ca)+(bc)(c−a)+(b−c).

Input

The first line contains tt (1t55)(1≤t≤55) — the number of test cases.

Each test case contains two integers aa and bb (1ab10).(1≤a≤b≤10).

Output

For each test case, output the minimum possible value of (ca)+(bc)(c−a)+(b−c) on a new line.

Example : in

3
1 2
3 10
5 5

Example : out

1
7
0

Note

In the first test case, you can choose c=1c=1 and obtain an answer of (11)+(21)=1(1−1)+(2−1)=1 . It can be shown this is the minimum value possible.

In the second test case, you can choose c=6c=6 and obtain an answer of (63)+(106)=7(6−3)+(10−6)=7 . It can be shown this is the minimum value possible.