#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
template<class T1,class T2> bool cmin(T1 &x,const T2 &y) { if (y<x) { x=y; return 1; }return 0; }
template<class T1,class T2> bool cmax(T1 &x,const T2 &y) { if (x<y) { x=y; return 1; }return 0; }
#define all(x) (x).begin(),(x).end()
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cout<<fixed<<setprecision(15);
	auto cal=[&]()
		{
			int n,m,i,j;
			cin>>m>>n;
			vector<pair<int,int>> eg;
			vector<int> single(n+1);
			while (m--)
			{
				int x,y;
				// cin>>x>>y;
				cin>>x>>y;
				if (x==y) single[x]=1;
				else
				{
					if (x>y) swap(x,y);
					eg.push_back({x,y});
				}
			}
			sort(all(eg)); eg.resize(unique(all(eg))-eg.begin());
			vector<int> cnt(n+1);
			for (auto [x,y]:eg) ++cnt[x],++cnt[y];
			vector e(n+1,vector<int>());
			vector<int> f(n+1);
			iota(all(f),0);
			function<int(int)> getf=[&](int u) { return f[u]==u?u:f[u]=getf(f[u]); };
			vector id(n+1,vector<int>());
			vector<int> sum(n+1);
			for (auto [x,y]:eg) if (cnt[x]+single[x]>1&&cnt[y]+single[y]>1)
			{
				e[x].push_back(y);
				e[y].push_back(x);
				f[getf(x)]=getf(y);
			}
			for (i=1; i<=n; i++) if (e[i].size()>=3) return 0;
			for (i=1; i<=n; i++) sum[getf(i)]+=e[i].size(),id[getf(i)].push_back(i);
			vector<int> loop;
			for (i=1; i<=n; i++) if (id[i].size()>1&&sum[i]==id[i].size()*2) loop.push_back(i);
			if (loop.size()>=2) return 0;
			if (loop.size()==1)
			{
				int x=loop[0];
				for (i=1; i<=n; i++) if ((e[i].size()||single[i])&&getf(i)!=x) return 0;
				return 1;
			}
			return 1;
		};
	if (cal()) cout<<"possible\n";
	else cout<<"impossible\n";
}