def fun(a):
    flag = False
    if(len(stack)==0):
        stack.append(a)
    else:
        lc = path[len(path)-1]
        if(k[a][lc-1]=='0'):
            trash.append(path[len(path)-1])
            path.pop()
    for i in range(n):
        if(k[a][i]=='1'):
            if(path.count(i+1)==0 and stack.count(i)==0 and trash.count(i)==0):
                flag = True
                stack.append(i)
            else:
                flag = False
    if(flag==False):
       trash.append(a)
    stack.pop(0)
    if(flag==True):
        path.append(a+1)
    if(stack.count(tl)!=0):
        path.append(tl+1)
        return True
    if(fun(stack[0])==True):
        return True

f  = open('input.txt','r')
res = f.read().split('\n')
f.close()
n = int(res[0])
k=[]
for i in range(n):
    temp = res[i+1].split(' ')
    k.append(temp)
lk = res[n+1].split(' ')
tk = int(lk[0])-1
tl = int(lk[1])-1
l = 0
print(tk+1,tl+1)
print("------------------")
path =[]
trash = []
stack =[]
fun(tk)
print("path:",path)