import java.util.Random;
import java.util.Scanner;

public class FindingLines {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int p = s.nextInt();
        
        if (n == 1) {
            System.out.println("possible");
            return;
        }
        
		int[][] points = new int[n][2];
        
		for(int i = 0; i < n; i++) {
			points[i][0] = s.nextInt();
			points[i][1] = s.nextInt();
		}
		int max = 0;
		Random r = new Random();
		for(int i = 0; i < 1000; i++) {
			int p1 = r.nextInt(n);
			int p2 = p1;
			while(p2 == p1)
				p2 = r.nextInt(n);
            double rise = points[p2][1] - points[p1][1];
            double run =  points[p2][0] - points[p1][0];
            if(run == 0) {
                int count = 0;
                for(int j = 0; j < n; j++)
                    if(points[j][0] == points[p1][0]) {
                        count++;
                    }
                if(count > max) {
                    max = count;
                }
            }
            else {
                int count = 1;
                double slope = rise/run;
                for(int j = 0; j < n; j++)
                    if(points[j][0] != points[p1][0])
                        if (((double) points[j][1] - points[p1][1])/((double) points[j][0] - points[p1][0]) == slope)
                            count++;
                if(count > max) {
                    max = count;
                }
            }
        }
        if(max >= Math.ceil(p/100. * n))
            System.out.println("possible");
        else
            System.out.println("impossible");
		
	}
}