#include<stdio.h>

 #include<string.h>

 int n,m,e[][],book[],cx[],cy[];

 int Maxmatch();

 int path(int u);

 int main()

 {

     int i,j;

     while(scanf("%d",&n), n != )

     {

         scanf("%d",&m);

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

             for(j=;j<=m;j++)

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

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

     }

     return ;

 }

 int Maxmatch()

 {

     int i,res=;

     memset(cx,0xff,sizeof(cx));

     memset(cy,0xff,sizeof(cy));

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

     {

         if(cx[i] == -)

         {

             memset(book,,sizeof(book));

             res += path(i);

         }

     }

     return res;

 }

 int path(int u)

 {

     int v;

     for(v=;v<=m;v++)

     {

         if(e[u][v] && !book[v])

         {

             book[v]=;

             if(cy[v] == -|| path(cy[v]))

             {

                 cx[u]=v;

                 cy[v]=u;

                 return ;

             }

         }

     }

     return ;

 }