1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 
 7 int vis[110],Map[110][110];
 8 int ok[110],n,m;
 9 
10 bool Find(int x)
11 {
12     for (int i=0;i<m;i++)
13     {
14         if (Map[x][i]==1&&!vis[i])
15         {
16             vis[i]=1;
17             if (ok[i]==-1)
18             {
19                 ok[i]=x;
20                 return true;
21             }
22             else
23             {
24                 if (Find(ok[i])==true)
25                 {
26                     ok[i]=x;
27                     return true;
28                 }
29             }
30         }
31     }
32     return false;
33 }
34 
35 int main()
36 {
37     int ans;
38     while (~scanf("%d",&n))
39     {
40         ans=0;
41         if (n==0)
42             break;
43         scanf("%d",&m);
44         memset(Map,0,sizeof(Map));
45         memset(ok,-1,sizeof(ok));
46         for (int i=0;i<n;i++)
47         {
48             for (int j=0;j<m;j++)
49             {
50                 scanf("%d",&Map[i][j]);
51             }
52         }
53         for (int i=0;i<n;i++)
54         {
55             memset(vis,0,sizeof(vis));
56             if (Find(i))
57             {
58                 ans++;
59             }
60         }
61         printf ("%d\n",ans);
62     }
63     return 0;
64 }