#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
#define rep(i, a, b) for(ll i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    ll n, k; cin >> n >> k;
    vector<unordered_set<ll>> adj(k);
    vector<bool> required(k, false);
    rep(i, 0, n) {
        ll a, b; cin >> a >> b; a--; b--;

        if (a == b) {
            required[a] = true;
            continue;
        }

        adj[a].insert(b);
        adj[b].insert(a);
    }

    ll nodeWithEdge = -1;
    rep(v, 0, k) {
        if (sz(adj[v]) == 1 && !required[v]) {
            required[*adj[v].begin()] = true;
            adj[*adj[v].begin()].erase(v);
            adj[v].clear();
        }

        if (sz(adj[v]) > 1) {
            nodeWithEdge = v;
        }
    }
    if (nodeWithEdge == -1) {
        cout << "possible" << endl;
        return 0;
    }

    bool tryCircle = true;
    rep(i, 0, k) {
        if (sz(adj[i]) >= 3) {
            cout << "impossible" << endl;
            return 0;
        }
        if (required[i] && sz(adj[i]) == 0) {
            tryCircle = false;
        }
    }

    vector<bool> used(k, false);
    bool hasCircle = true;
    if (tryCircle) {
        // check connected
        queue<ll> todo;
        todo.push(nodeWithEdge);
        used[nodeWithEdge] = true;
        while(!todo.empty()) {
            ll v = todo.front();
            todo.pop();

            for(auto u : adj[v]) {
                if (used[u]) continue;

                todo.push(u);
                used[u] = true;
            }
        }

        rep(i, 0, k) {
            if (sz(adj[i]) == 1) hasCircle = false;
            if (sz(adj[i]) == 2 && !used[i]) hasCircle = false;
        }

        if (hasCircle) {
            cout << "possible" << endl;
            return 0;
        }
    }

    ll countDeg2 = 0;
    vector<ll> deg1Nodes;
    deg1Nodes.reserve(k);
    rep(i, 0, k) {
        if (sz(adj[i]) == 1) {
            deg1Nodes.push_back(i);
        }

        if (sz(adj[i]) == 2) countDeg2++;
    }

    if (countDeg2 == 0) {
        cout << "possible" << endl;
        return 0;
    }

    used.assign(k, false);
    for(auto deg1Node : deg1Nodes) {
        if (used[deg1Node]) continue;
        ll currNode = deg1Node;
        ll prevNode = -1;
        do {
            for(auto next : adj[currNode]) {
                if (next == prevNode) continue;
                prevNode = currNode;
                currNode = next;
                countDeg2--;
            }
        } while(sz(adj[currNode]) == 2);
        countDeg2++;
        if (countDeg2 == 0) {
            cout << "possible" << endl;
            return 0;
        }
        used[currNode] = true;
    }

    cout << "impossible" << endl;
}