NSTEPS - Number Steps

Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2, ... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.

 

Illustration

 

You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0...10000.

Input

The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.

Output

For each point in the input, write the number written at that point or write No Number if there is none.

Example

Input:
3
4 2
6 6
3 4

Output:
6
12
No Number

Added by:Camilo Andrés Varela León
Date:2006-11-25
Time limit:1.159s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Asia - Tehran 2000

hide comments
2017-01-27 11:39:28 giriprasad kemburu
AC in one go.
#My 23rd.
2017-01-23 20:57:53
There can be more than one pattern for this. Wasted my time over this.
2017-01-19 16:53:56
#easy problem. Please do check your limits properly.
2016-12-23 09:01:31
AC in one go !! do it with pen paper and you get it!!!
2016-12-16 13:28:39
silly mistakes,.... do care about the positions x and y while framing the logic behind that -_-

Last edit: 2016-12-16 13:34:51
2016-12-04 10:16:19
Haha.. Both N's are capital!!!
2016-07-27 18:46:08
AC, first try. Pretty easy, just find the pattern.
2016-06-28 12:40:15
if else if else if else....
gg


Last edit: 2016-06-28 12:40:41
2016-06-19 04:19:24
AC in first try.
2016-06-08 11:32:24
#easy_one
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.