B. Set of Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputConvexity of a set of points on the plane is the size of the largest subset of points that form a convex polygon. Your task is to build a set of n points with the convexity of exactly m. Your set of points should not contain three points that lie on a straight line.InputThe single line contains two integers n and m (3 ≤ m ≤ 100, m ≤ n ≤ 2m).OutputIf there is no solution, print "-1". Otherwise, print n pairs of integers — the coordinates of points of any set with the convexity of m. The coordinates shouldn't exceed 108 in their absolute value.ExamplesInput4 3Output0 03 00 31 1Input6 3Output-1Input6 6Output10 0-10 010 19 19 -10 -2Input7 4Output176166 6377709276 539564654734 174109910147 434207790497 366519606663 21061859328 886001
Input4 3
Output0 03 00 31 1
['constructive algorithms', 'geometry', '*2300']