Calculate Total Number of Stakes

You are given several test cases. In each test case, you are provided with the dimensions of a rectangular area, represented by its length, l, and width, w. Your task is to compute the total number of stakes required to enclose the rectangle. The number of stakes is calculated using the formula: $$ stakes = 2 \times (l+w) $$.

For each test case, read the pair of integers l and w and output the computed number of stakes.

inputFormat

The input is read from standard input (stdin) and follows the format below:

• The first line contains a single integer T indicating the number of test cases.
• Each of the next T lines contains two space-separated integers l and w, representing the length and width of the rectangle.

outputFormat

For each test case, output a single line containing the total number of stakes required. The result for each test case should be printed on a new line.

## sample

3
3 1
2 2
4 4

8
8
16

</p>