#include <iostream>
#include <fstream>
using namespace std;

int n,a[100][100],k,s[100],i,j,viz[100];

void citire()
{
    ifstream f("parcurgereDF.txt");
    f>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        f>>a[i][j];
}

int parcurgere_DF(int x,int y)
{
    int u;
    u=1;
    viz[x]=1;
   // cout<<"ORDINEA PARCURGERII ESTE";
   // cout<<x;
   s[u]=x;
    int ok=0;
    while(u>0)
    {
        k=s[u];
        j=1;
        while( j<=n && (a[k][j]==0||(a[k][j]==1 && viz[j]==1)))
            j++;
        if(j<=n)
        {
            u++;
            s[u]=j;
            viz[j]=1;
        //    cout<<j<<" ";
            if(j==y)ok=1;
        }
        else u--;

    }
    if(ok==1)cout<<endl<<"exista lant intre nodurile "<<x<<" si "<<y<<endl;
    else cout<<endl<<" nu exista lant intre nodurile "<<x<<" si "<<y<<endl;

}


int main ()
{
    //verificare daca exista lant intre x si y
    int x,y;
    cin>>x>>y;
    parcurgere_DF(x,y);

}