dfs

var
    g:array[1..1000,1..1000] of 0..1;
    used:array[1..1000] of boolean;
    i,j,n,k,v:longint;

procedure dfs(v:longint);
var j:longint;
 begin
   used[v]:=true;
   for j:=1 to n do
     if (g[v][j] = 1) and (not used[j]) then
        dfs(j);
 end;

Begin
  read(n,v);
  for i:=1 to n do
    for j:=1 to n do
       read(g[i][j]);
  dfs(v);
end.