NSTEPS  Number Steps
Starting from point (0,0) on a plane, we have written all nonnegative 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.
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
hide comments
Shashank Gupta:
20131110 06:34:46
Only 17 lines of C...I was forgetting return 0 so I thought I did something wrong. :P 

Arpit Uppal:
20130828 15:44:25
damn easy.. my 50th classical on spoj :) 

GAURANGA:
20130811 17:45:35
most easy...remembr y cordinate cannot exceed x cordinate 

Amitayush Thakur:
20130726 05:35:44
Time limit should be reduce to 0.05 secs or else this question should be moved to tutorial.Just too easy to do :D 

rishi:
20130615 12:33:33
no number should be printed exactly as specified...threw WA at me just for lower case! 

Divya Gupta:
20130320 22:24:23
why wa always; 

Sivaraman Nagarajan:
20130220 16:41:01
All that is needed is 2 If condition . Took 5 + 5 minutes 

Satinjal Yadav:
20130206 14:35:39
easiest problem>>>>>>>>


saurabh:
20130203 11:16:42
just see the pattern .........


Narendra yadav:
20130114 18:47:01
sachinmenezes : Print every time in a new line 
Added by:  Camilo Andrés Varela León 
Date:  20061125 
Time limit:  1.159s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Asia  Tehran 2000 