A coordinate plane holds N distinct points. Decide whether some line passes through at least p percent of them. In other words, decide whether a line passes through at least 0.01×N×p points.
The first line has the number of points N (1≤N≤105).
The second line has the percentage p as an integer (20≤p≤100).
Each of the next N lines has the coordinates x and y of one point as two integers separated by a space (0≤x,y≤109).
All given points are distinct.
Print possible if such a line exists, and impossible otherwise.
In the first example the line through (0,0), (3,3) and (10,10) works. It passes through 3 points, which meets the requirement of 2.75.