螺旋队列问题：看清以上数字排列的规律，设 1 点的坐标是 (0,0)，x 方向向右为正，y 方向向下为正。例如，7 的坐标为 (-1,-1)，2 的坐标为 (0,1)，3 的坐标为 (1,1)。编程实现输入任意一点坐标 (x,y)，输出所对应的数字。

-Spiral queue problem: see the above figures with the laws of 1:00 set the coordinates are (0,0), x direction to the right is positive, y direction is positive downward. For example, 7 of the coordinates (-1,-1), 2 coordinates for (0,1), 3 coordinates for the (1,1). Programming enter coordinates of any point (x, y), corresponding to the output figure.