#include <iostream>
#include<stdio.h>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <sstream>
///
using namespace std;
int matrix[210][210];
int judge[210];
int degree[210];
int intersections,road;
void dfs(int n)
{
judge[n]=1;
for(int i=0;i<intersections;i++)
if(!judge[i] && matrix[n][i])
dfs(i);
}
int main()
{
int i,j;
while (scanf("%d%d",&intersections,&road)==2)
{
memset(matrix,0,sizeof(matrix));
memset(judge,0,sizeof(judge));
memset(degree,0,sizeof(degree));
if(!road)
{
cout<<"Not Possible"<<endl;
continue;
}
bool flag= true;
int a,b;
for(i=0;i<road;i++)
{
scanf("%d%d",&a,&b);
matrix[a][b] = matrix[b][a]=1;
degree[a]++;
degree[b]++;
}
for(i=0;i<intersections;i++)
{
if(degree[i]&1)
{
flag =false;
break;
}
}
if(flag)
{
for(i=0;i<intersections;i++)
if(degree[i])
{
dfs(i);
break;
}
for(j=0;j<intersections;j++)
{
if(degree[j]!=0 && !judge[j])
{
flag =false;
break;
}
}
}
if(flag)
cout<<"Possible"<<endl;
else
cout<<"Not Possible"<<endl;
}
}