B'Currently Tiny is learning Computational Geometry. When trying to solve a problem called "The Closest Pair Of Points In The Plane", he found that a code which gave a wrong time complexity got Accepted instead of Time Limit Exceeded. The problem is the follows. Given n points in the plane, find a pair of points between which the distance is minimized. Distance between (x1, xe2 x80 x89y1) and (x2, xe2 x80 x89y2) is . The pseudo code of the unexpected code is as follows: Here, tot can be regarded as the running time of the code. Due to the fact that a computer can only run a limited number of operations per second, tot should not be more than k in order not to get Time Limit Exceeded. You are a great hacker. Would you please help Tiny generate a test data and let the code get Time Limit Exceeded? A single line which contains two space-separated integers n and k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892000, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109). If there doesn 't exist such a data which let the given code get TLE, print "no solution" (without quotes); else print n lines, and the i-th line contains two integers xi, xe2 x80 x89yi (|xi|, xe2 x80 x89|yi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) representing the coordinates of the i-th point. The conditions below must be held:'...