import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class F {
	Scanner in = new Scanner(System.in);

	private double getSlope(int x1, int y1, int x2, int y2){
		return 1.0*(y2-y1)/(x2-x1);
	}
	
	private double[][] makeArray(int[] x, int[] y, int n ){
		double[][] M = new double[n][n];
		for (int i=0; i<n; i++){
			for (int j=0; j<n; j++){
				if (i==j){M[i][j] = 1;}
				else{
					if (x[i]==x[j]){M[i][j]=1;}
					else{M[i][j] = getSlope(x[i], y[i], x[j], y[j]);}
				}
			}
		}


		return M;
	}




	private void go(){
		int n = in.nextInt();
		int p = in.nextInt();
		int[] x = new int[n];
		int[] y = new int[n];
		for (int i=0; i<n; i++){
			x[i] = in.nextInt();
			y[i] = in.nextInt();
		}
		String result = "impossible";
		double[][] M = makeArray(x,y, n);


//		boolean done = false;
//		for (int i=0; i<n; i++){
//			HashMap<Double, Integer> counts = new HashMap<Double, Integer>();
//			for (int j=0; j<n; j++){
//				if (!counts.containsKey(M[i][j])){
//					counts.put(M[i][j], 0);
//				}
//				counts.put(M[i][j], counts.get(M[i][j])+1);
//			}
//			for (Map.Entry<Double, Integer> entry: counts.entrySet()){
//				if ((1.0*entry.getValue()+1)/n * 100 >=p ){
//					result = "possible";
//					done=true;
//					break;
//				}				
//			}
//			if(done){break;}
//		}

		System.out.println(result);

	}

	public static void main(String[] args){
		F f = new F();
		f.go();
	}


}