#include<bits/stdc++.h>
using namespace std;
vector<int>adj_list[100];
int visited[100];
int zaoa_zay=0;
void DFS(int currnode,int dest)
{
cout<<"*"<<currnode<<endl;
if(zaoa_zay==1)
return;
visited[currnode]=1;
if(currnode==dest)
{
zaoa_zay=1;
return;
}
else
{
for(int i=0;i<adj_list[currnode].size();i++)
{
int child=adj_list[currnode][i];
if(visited[child]!=-1)
{
DFS(child,dest);
}
}
}
}
int main()
{
int node,edge;
cin>>node>>edge;
int u,v;
cin>>u>>v;
adj_list[u].push_back(v);
int start,dest;
cin>>start>>dest;
DFS(start,dest);
if(zaoa_zay==1)
{
cout<<"connected"<<endl;
}
else
{
cout<<"disconnected"<<endl;
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdmVjdG9yPGludD5hZGpfbGlzdFsxMDBdOwppbnQgdmlzaXRlZFsxMDBdOwppbnQgemFvYV96YXk9MDsKdm9pZCBERlMoaW50IGN1cnJub2RlLGludCBkZXN0KQp7CmNvdXQ8PCIqIjw8Y3Vycm5vZGU8PGVuZGw7CmlmKHphb2FfemF5PT0xKQpyZXR1cm47CnZpc2l0ZWRbY3Vycm5vZGVdPTE7CmlmKGN1cnJub2RlPT1kZXN0KQp7Cnphb2FfemF5PTE7CnJldHVybjsKfQplbHNlCnsKZm9yKGludCBpPTA7aTxhZGpfbGlzdFtjdXJybm9kZV0uc2l6ZSgpO2krKykKewppbnQgY2hpbGQ9YWRqX2xpc3RbY3Vycm5vZGVdW2ldOwppZih2aXNpdGVkW2NoaWxkXSE9LTEpCnsKREZTKGNoaWxkLGRlc3QpOwp9Cn0KfQp9CmludCBtYWluKCkKewppbnQgbm9kZSxlZGdlOwpjaW4+Pm5vZGU+PmVkZ2U7CmludCB1LHY7CmNpbj4+dT4+djsKYWRqX2xpc3RbdV0ucHVzaF9iYWNrKHYpOwppbnQgc3RhcnQsZGVzdDsKY2luPj5zdGFydD4+ZGVzdDsKREZTKHN0YXJ0LGRlc3QpOwppZih6YW9hX3pheT09MSkKewpjb3V0PDwiY29ubmVjdGVkIjw8ZW5kbDsKfQplbHNlCnsKY291dDw8ImRpc2Nvbm5lY3RlZCI8PGVuZGw7Cn0KfQo=