#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,m;
int in[N];
struct node{
	int x,y;
}Q[N],E[N];
inline bool cmp(node a,node b){
	return a.x==b.x?a.y<b.y:a.x<b.x;
}
inline void Rd(int &res){
	char c;res=0;
	while(c=getchar(),c<48);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
	return;
}
bool mark[N],vis[N];
inline bool add_edge(int a,int b){
	if(E[a].x==-1)E[a].x=b;
	else if(E[a].y==-1)E[a].y=b;
	else return false;
	return true;
}
int dfs(int x,int f){
	if(x==-1)return 2;
	if(vis[x])return 1;
	vis[x]=1;
	int nxt=Q[x].x;
	if(Q[x].x==f)nxt=Q[x].y;
	return dfs(nxt,x);
}
inline bool check(){
	for(int i=1;i<=m;i++)E[i].x=-1,E[i].y=-1;
	for(int i=1;i<=n;i++)if(Q[i].x==Q[i].y)mark[Q[i].x]=1;
	for(int i=1;i<=n;i++){
		if(Q[i].x==Q[i].y)continue;
		if(!add_edge(Q[i].x,Q[i].y))return false;
		if(!add_edge(Q[i].y,Q[i].x))return false;
	}
	int key=0;
	for(int i=1;i<=n;i++)if(!vis[i]){
		if(E[i].x==-1)continue;
		if(key==1)return false;
		int o=dfs(E[i].x,-2);
		if(o==1){
			if(key)return false;
			key=1;
		}
		else{
			key=2;
			dfs(E[i].y,-2);
		}
	}
	if(key==2)return true;
	for(int i=1;i<=n;i++)if(mark[i]&&!vis[i])return false;
	return true;
}
int main(){
	Rd(n);Rd(m);
	for(int i=1;i<=n;i++){
		Rd(Q[i].x);Rd(Q[i].y);
		if(Q[i].x>Q[i].y)swap(Q[i].x,Q[i].y);
	}
	
	sort(Q+1,Q+n+1,cmp);
	int h=1;
	for(int i=2;i<=n;i++)if(Q[i].x!=Q[h].x||Q[i].y!=Q[h].y)Q[++h]=Q[i];
	n=h;
	for(int i=1;i<=n;i++)in[Q[i].x]++,in[Q[i].y]++;
	h=0;
	for(int i=1;i<=n;i++)if(in[Q[i].x]>1&&in[Q[i].y]>1&&Q[i].x!=Q[i].y)Q[++h]=Q[i];
	n=h;
	if(check())puts("possible");
	else puts("impossible");
	return 0;
}