In this problem you will work on a plane, where the natural numbers are arranged in a stair pattern.

Starting on coordinate (2, 1) through (2, 23) are the first 23 natural numbers in sequence, 1 is in (2,1), 2 is in (2,2) and so on..., the next 23 natural numbers (24 to 46) are arranged from (2, 24) through (24, 24), the next 23 from (25, 24) through (25, 46), a stair pattern where each step is 24 numbers high, this pattern continues infinitely.

    Y-axis
      |                       48
      |  24 25 26 27 . . . 46 47
      |  23
      |   .
      |   .
      |   .
      |   3
      |   2
      |   1
      |_____________________________ X-axis

Input

You will be given a series of queries that could be one or two integers per line.

The last test case is 0 0.

each integer N, X_i, Y_i satisfy: 1 ≤ N, X_i, Y_i, ≤ 10¹⁵.

Output

If the test case is one integer you have to output two comma separated integers denoting the coordinates (x, y) of the selected number, if there are two numbers you have to output one integer that corresponds to the integer that is located in those coordinates, if there is no number with such coordinates, output the string "No Number"

Example

Input:
2
2 7
3 7
0 0

Output:
2, 2
7
No Number