import java.awt.Point;
import java.util.*;

/**
 * Created by jordanly on 1/7/15.
 */
public class Finding_Lines {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int numPoints = in.nextInt();
        int goal = in.nextInt();

        Point[] points = new Point[numPoints];
        for (int i = 0; i < points.length; i++) {
            points[i] = new Point(in.nextInt(), in.nextInt());
        }

        Map<Double, Integer> count = new HashMap<Double, Integer>();
        for (int i = 0; i < points.length - 1; i++) {
            for (int j = i + 1; j < points.length; j++) {
                double val = slope(points[i], points[j]);
                if (!count.containsKey(val)) {
                    count.put(val, 0);
                }
                count.put(val, count.get(val) + 1);
            }
        }

        for (int v : count.values()) {
            int perc = (int) (((double) v)/numPoints * 100);
            if (perc > goal) {
                System.out.println("possible");
                return;
            }
        }

        System.out.println("impossible");
    }

    public static double slope(Point a, Point b) {
        return ((double) (a.x - b.x))/(a.y - b.y);
    }
}