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();
		
		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 < 100000; i++) {
			int p1 = r.nextInt(n);
			int p2 = p1;
			while(p2 == p1)
				p2 = r.nextInt(n);
			int count = 1;
			double slope = ((double) points[p2][1] - points[p1][1])/((double) points[p2][0] - points[p1][0]);
			for (int j = 0; j < n; j++) {
				if(j != p1) {
					if ((points[j][0] - points[p1][0]) * slope == points[j][1] - points[p1][1])
						count ++;
				}
			}
			if (count > max) 
				max = count;
		}
		if (max >= (int) Math.ceil(n * p / 100.))
			System.out.println("possible");
		else
			System.out.println("impossible");
		
	}
}