#include"bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define endl "\n"
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;


template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
typedef Point P;
T x, y;
explicit Point(T x=0, T y=0) : x(x), y(y) {}
bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
P operator+(P p) const { return P(x+p.x, y+p.y); }
P operator-(P p) const { return P(x-p.x, y-p.y); }
P operator*(T d) const { return P(x*d, y*d); }
P operator/(T d) const { return P(x/d, y/d); }
T dot(P p) const { return x*p.x + y*p.y; }
T cross(P p) const { return x*p.y - y*p.x; }
T cross(P a, P b) const { return (a-*this).cross(b-*this); }
T dist2() const { return x*x + y*y; }
double dist() const { return sqrt((double)dist2()); }
// angle to x=axis in interval [=pi , pi ]
double angle() const { return atan2(y, x); }
P unit() const { return *this/dist(); } // makes d i s t ()=1
P perp() const { return P(-y, x); } // rotates +90 degrees
P normal() const { return perp().unit(); }
// returns point rotated ’a ’ radians ccw around the origin
P rotate(double a) const {
return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
friend ostream& operator<<(ostream& os, P p) {
return os << "(" << p.x << "," << p.y << ")"; }
};

typedef Point<double> P;
int main() {
	cin.tie(0)->sync_with_stdio(0);
    
    int pts;cin>>pts;
    if (pts==1){
        cout << "possible" << endl;
        return 0;
    }
    double perc;cin>>perc;
    int goal = ceil((double)pts*perc/100);
    vector<P> points(pts);
    rep(i,0,pts){
        double a,b;cin>>a>>b;
        points[i]=P(a,b);
    }

    for (int i=0;i<1'000;i++){
        int rand_a=rand()%pts;
        int rand_b=rand()%pts;
        while (rand_a==rand_b)rand_b=rand()%pts;
        P a = points[rand_a];
        P b = points[rand_b];
        int cnt=0;
        for (auto l:points){
            if (a.cross(b,l)==0)cnt++;
        }
        if (cnt>=goal){
            cout << "possible" << endl;
            return 0;
        }
    }
    cout << "impossible" << endl;


}