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
2013-02-03 11:16:42 saurabh
just see the pattern .........
HInt:-see even and odd number
2013-01-14 18:47:01 Narendra yadav
sachinmenezes : Print every time in a new line
2013-01-09 15:27:45 Anubhav Balodhi
i thought da pattern really continued i.e. at (4,0) there is a 4 n so on... damn wrong answer :O
2012-10-03 18:42:20 Sachin
works fine at home but when submiting says wrong answer
2012-10-03 15:12:32 Siddharth Shah
brute force exceeds the time limit. Have to go by some other way :(
2012-07-18 16:17:42 sathyanarayanan
use brute force...easy problem :P :)

Last edit: 2012-07-18 16:18:47
2012-06-28 15:42:42 Fish3R
Just analyse the figure... Easy problem.. :D
2012-06-27 21:01:21 sachin tendulkar
easy! logic from fig.
2012-06-12 15:11:30 marwan akkad
I got AC for the first time.
one of the most interesting problem in SPOJ
2012-05-31 02:49:25 jorsan
i have the same problem of Sarwesh Shah,and i dont understand why, please answer

Last edit: 2012-05-31 02:50:08
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.