We would like to cross over a river by stepstones. The position of a stepstone is represented by (x,y). You can jump to another stepstone, however, you have certain constraint due to your physical ability. When you are at (x,y), you are only allowed to jump to stones at (x'^y) where lx - x'l s 2 and ly - yl s 2. For instance, you can jump from (0,0) to (2,2) or (2,1), but you cannot move to (3,0). The goal is reaching a line y-G which is parallel to x-axis. You are required to find a shortest path from (0,0)to the goal line in terms of the sum of distances. The distance between two stones at (x,y) and (x',y') is the Euclidean distance /(x - x')2 + (y-y')2 In the first line, two integers n(1