#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn =  + ;

 struct Edge

 {

     int from,to,cap,flow;

     Edge(int u,int v,int w,int f):from(u),to(v),cap(w),flow(f){}

 };

 struct Dinic

 {

     int n,m,s,t;

     vector<Edge> edges;

     vector<int> G[maxn];

     bool vis[maxn];

     int cur[maxn];

     int d[maxn];

     void init(int n)

     {

         this->n=n;

         for(int i=;i<n;++i) G[i].clear();

         edges.clear();

     }

     void AddEdge(int from,int to,int cap)

     {

         edges.push_back( Edge(from,to,cap,) );

         edges.push_back( Edge(to,from,,) );

         m=edges.size();

         G[from].push_back(m-);

         G[to].push_back(m-);

     }

     bool BFS()

     {

         queue<int> Q;

         memset(vis,,sizeof(vis));

         vis[s]=true;

         d[s]=;

         Q.push(s);

         while(!Q.empty())

         {

             int x=Q.front(); Q.pop();

             for(int i=;i<G[x].size();++i)

             {

                 Edge& e=edges[G[x][i]];

                 if(!vis[e.to] && e.cap>e.flow)

                 {

                     vis[e.to]=true;

                     d[e.to]=d[x]+;

                     Q.push(e.to);

                 }

             }

         }

         return vis[t];

     }

     int DFS(int x,int a)

     {

         if(x==t || a==) return a;

         int flow=, f;

         for(int &i=cur[x];i<G[x].size();++i)

         {

             Edge &e=edges[G[x][i]];

             if(d[e.to]==d[x]+ && (f=DFS(e.to,min(a,e.cap-e.flow) ) )>)

             {

                 e.flow +=f;

                 edges[G[x][i]^].flow -=f;

                 flow +=f;

                 a -=f;

                 if(a==) break;

             }

         }

         return flow;

     }

     int Maxflow(int s,int t)

     {

         this->s=s; this->t=t;

         int flow=;

         while(BFS())

         {

             memset(cur,,sizeof(cur));

             flow +=DFS(s,INF);

         }

         return flow;

     }

 }DC;

 int n,s,t;

 int mp[maxn][maxn];

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d%d%d",&n,&s,&t))

     {

         int dst=*n+;

         DC.init(dst+);

         for(int i=;i<=n;i++)

         {

             if(i==s || i==t)   DC.AddEdge(i,i+n,INF);

             else DC.AddEdge(i,i+n,);

         }

         for(int i=;i<=n;i++)

         {

             for(int j=;j<=n;j++)

             {

                 scanf("%d",&mp[i][j]);

                 if(i==j)  continue;

                 if(mp[i][j]) DC.AddEdge(i+n,j,INF);

             }

         }

         if(mp[s][t])  {puts("NO ANSWER!");continue;}

         int cnt=DC.Maxflow(s,t);

         vector<int> ans;

         printf("%d\n",cnt);

         if(cnt==)   continue;

         for(int i=;i<*n;i+=)  //前2*n条边为每个顶点，依次枚举

         {

             Edge& e=DC.edges[i];

             if(e.from==s || e.from==t)  continue;

             e.cap=;  //删边

             for(int j=;j<*n;j++) DC.edges[j].flow = ;

             int tmp=DC.Maxflow(s,t);  //如果流量改变，说明这条边是割边

             if(tmp<cnt)

             {

                 cnt=tmp;

                 ans.push_back(e.from);

             }

             else e.cap=;

             if(cnt<=)  break;

         }

         for(int i=;i<ans.size();i++)

         {

             printf("%d%c",ans[i],i==ans.size()-?'\n':' ');

         }

         printf("\n");

     }

     return ;

 }