#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ; 
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e5 + 7 ;

int n , k ;
set < int > v[ MAXN ] ;
bool used[ MAXN ] ;
pii a[ MAXN ] ;

int prv[ MAXN ] , rnk[ MAXN ] ;
bool leaf[ MAXN ] ;

int get ( int x ) {
    if ( prv[ x ] == -1 ) { return x ; }
    int y = get ( prv[ x ] ) ;
    prv[ x ] = y ;
    return y ;
}

int unite ( int x , int y ) {
    int k1 = get ( x ) , k2 = get ( y ) ;
    if ( k1 == k2 ) { return 1 ; }
    if ( rnk[ k1 ] >= rnk[ k2 ] ) {
        rnk[ k1 ] += ( rnk[ k1 ] == rnk[ k2 ] ) ;
        prv[ k2 ] = k1 ;
    }
    else {
        prv[ k1 ] = k2 ;
    }
    return 0 ;
}

void solve ( ) {
    cin >> n >> k ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ].fi >> a[ i ].se ;
        used[ a[ i ].fi ] = used[ a[ i ].se ] = true ;
        if ( a[ i ].fi != a[ i ].se ) {
            v[ a[ i ].fi ].insert ( a[ i ].se ) ;
            v[ a[ i ].se ].insert ( a[ i ].fi ) ;
        }
    }
    for ( int i = 1 ; i <= k ; ++ i ) {
        prv[ i ] = -1 ;
        if ( used[ i ] == true && v[ i ].size ( ) == 1 ) { leaf[ i ] = true ; }
    }
    int cycles = 0 ;
    for ( int i = 1 ; i <= k ; ++ i ) {
        if ( used[ i ] == false ) { continue ; }
        int cnt = 0 ;
        for ( auto y : v[ i ] ) {
            if ( leaf[ y ] == false ) { ++ cnt ; }
        }
        if ( cnt > 2 ) {
            cout << "impossible\n" ;
            return ;
        }
    }
    set < pii > foo ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( a[ i ].fi > a[ i ].se ) { swap ( a[ i ].fi , a[ i ].se ) ; }
        if ( a[ i ].fi != a[ i ].se && foo.find ( { a[ i ].fi , a[ i ].se } ) == foo.end ( ) ) {
            foo.insert ( { a[ i ].fi , a[ i ].se } ) ;
            cycles += unite ( a[ i ].fi , a[ i ].se ) ;
        }
    }
    if ( cycles > 1 ) {
        cout << "impossible\n" ;
        return ;
    }
    if ( cycles == 0 ) {
        cout << "possible\n" ;
        return ;
    }
    int rep = -1 ;
    for ( int i = 1 ; i <= k ; ++ i ) {
        if ( used[ i ] == false ) { continue ; }
        int hh = get ( i ) ;
        if ( rep == -1 ) { rep = hh ; }
        if ( rep != hh ) {
            cout << "impossible\n" ;
            return ;
        }
    }
    cout << "possible\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}