B'You are given a checkerboard of size 201 x 201 , i. e. it has 201 rows and 201 columns. The rows of this checkerboard are numbered from -100 to 100 from bottom to top. The columns of this checkerboard are numbered from -100 to 100 from left to right. The notation (r, c) denotes the cell located in the r -th row and the c -th column. There is a king piece at position (0, 0) and it wants to get to position (a, b) as soon as possible. In this problem our king is lame. Each second, the king makes exactly one of the following five moves. What is the minimum number of seconds the lame king needs to reach position (a, b) ? The first line of the input contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. Then follow t lines containing one test case description each. Each test case consists of two integers a and b ( -100 <= q a, b <= q 100 ) -- the position of the cell that the king wants to reach. It is guaranteed that either a ne 0 or b ne 0 . Print t integers. The i -th of these integers should be equal to the minimum number of seconds the lame king needs to get to the position he wants to reach in the i -th test case. The king always starts at position (0, 0) . One of the possible solutions for the first example is: go down, go right, go down, go right, go down, go left, go down. One of the possible solutions for the second example is to alternate "go right" and "go up" moves 4 times each. One of the possible solutions for the third example is to alternate "go left" and "skip" moves starting with "go left". Thus, "go left" will be used 6 times, and "skip" will be used 5 times. '...