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

vector<int>g[100];
int vis[100];

void graph(int i,int j){
    g[i].push_back(j);
    g[j].push_back(i);
}

void bfs(int s,int nd)
{
    queue<int>q;
    for(int i=0;i<=nd;i++)vis[i]=0;
    q.push(s);
    vis[s]=1;
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(int i=0;i<g[u].size();i++){
            int v=g[u][i];
            if(vis[v]==0){

                vis[v]=1;
                q.push(v);
            }
        }
    }

}





int main()
{
    int nd,s,flag=0;
    cin>>s>>nd;
    while(nd--){
        int x,y;
        cin>>x>>y;
        graph(x,y);
    }
    bfs(s,nd);
    for(int i=1;i<=nd;i++){
        if(vis[i]==0) {flag=1;}
    }
    if(flag==1) cout<<"Not connected"<<endl;
    else if(flag==0) cout<<"Connected"<<endl;
}