stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<cstdio>

using namespace std;

int f[15][10005];

int n,m;

int anss=0,ans=0;

void dfs(int q){

	if(q>n){

		//if(ans>anss)anss=ans;

		return ;

	}

	ans=0;

	for(int j=1;j<=m;j++){

		int count=0;

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

			if(f[i][j]==0)count++;

		}//cout<<"count "<<count<<endl;

		if(count>n/2)ans+=count;

		else ans+=n-count;

	}

	//cout<<"ans "<<ans<<endl;

	if(ans>anss)anss=ans;//cout<<anss<<endl;

	dfs(q+1);

	//ans=0;

	for(int j=1;j<=m;j++){

		f[q][j]=(f[q][j]+1)%2;

	}



	dfs(q+1);

	for(int j=1;j<=m;j++){

		f[q][j]=(f[q][j]+1)%2;

	}

}

int main(){

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

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

			for(int j=1;j<=m;j++){

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

			}

		}

		dfs(1);

		cout<<anss<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.12811356845267x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



bitset<10000> maze[10];



int main(){

    ios::sync_with_stdio(false);

    cin.tie(NULL);

    int r, c;

    while(cin >> r >> c, (r && c)){

        for(int i = 0; i < r; ++i)

            for(int j = 0; j < c; ++j){

                bool tmp;

                cin >> tmp;

                maze[i][j] = tmp;

            }

        int time = 1 << r;

        int ans = 0;

        for(int i = 0; i < time; ++i){

            for(int j = 0; j < r; ++j)

                if(i & (1 << j))

                    maze[j].flip();

            int result = 0;

            for(int C = 0; C < c; ++C){

                int cntpercol = 0;

                for(int R = 0; R < r; ++R)

                    if(maze[R][C])

                        ++cntpercol;

                result += max(cntpercol, r - cntpercol);

            }

            ans = max(ans, result);

            for(int j = 0; j < r; ++j)

                if(i & (1 << j))

                    maze[j].flip();

        }

        cout << ans << endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.222999056347204x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <algorithm>

#include <cstdio>

using namespace std;

#define MAX_R 10

#define MAX_C 10000

int R,C;

int res;

int G[MAX_R + 1][MAX_C + 1];

int main(){

    while(cin >> R >> C){

        if(!(R || C)) break;

        for(int i = 0 ; i < R ; i++)

            for(int j = 0 ; j < C ; j++)

                cin >> G[i][j];

        int BIT_SIZE = 1 << R;

        res = 0;

        for(int j = 0 ; j < BIT_SIZE ; j++){

            int total = 0;

            for(int cc = 0 ; cc < C ; cc++){

                int k = j;

                int num0 = 0,num1 = 0;

                for(int rr = 0 ; rr < R ; rr++){

                    if(k & 1) G[rr][cc] ? num1++ : num0++;

                    else G[rr][cc] ? num0++ : num1++;

                    k >>= 1;

                }

                total += max(num0,num1);

            }

            res = max(res,total);

        }

        cout << res << endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.147993836453808x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <cstdlib>

#include <cstring>

bool table[12][10005];

using namespace std;

int r,c;

int ans;

int ji(){

    int op=0;

    for(int j=1;j<=c;j++){

        int a=0,b=0;

        for(int i=1;i<=r;i++){

            if(table[i][j]) a++;

            else b++;

        }

        op+=(a>b?a:b);

    }

    return op;

}

void br(int now){

    if(now>r){

        int bi=ji();

        ans=ans>bi?ans:bi;

        return ;

    }

    br(now+1);

    for(int i=1;i<=c;i++)

        if(table[now][i]) table[now][i]=false;

        else table[now][i]=true;

    br(now+1);

    for(int i=1;i<=c;i++)

        if(table[now][i]) table[now][i]=false;

        else table[now][i]=true;

}

int main(void){

    while(cin>>r>>c){

        if(0==r&&0==c) break;

        memset(table,0,sizeof(table));

        ans=-1000000;

        for(int i=1;i<=r;i++)

            for(int j=1;j<=c;j++){

                cin>>table[i][j];

            }

        br(1);

        cout<<ans<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.83539450499409x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

#include<bitset>



using namespace std;



const int MAXR = 15, MAXC = 10000+100;

int mapp[MAXR][MAXC];

int r, c;





int main()

{

    while(scanf("%d%d", &r, &c) == 2 && r && c)

    {

        for(int i=0; i<r; ++i)

        {

            for(int j=0; j<c; ++j)

            {

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

            }

        }

        int ans = 0;

        bitset<32> bs;

        for(int i=0; i<r; i++) bs[i] = 1;

        int m = bs.to_ulong();

        for(unsigned int i=0; i<=m; i++)

        {

            bs = i;

            int cnt = 0;

            for(int j=0; j<c; j++)

            {

                int cnt1 = 0, cnt0 = 0;

                for(int k=0; k<r; k++)

                {

                    if(mapp[k][j] && bs[k]==0) cnt1++;

                    else if(!mapp[k][j] && bs[k]) cnt1++;

                    else cnt0++;

                }

                cnt+= max(cnt1, cnt0);

            }

            ans = max(ans, cnt);

        }

        cout << ans << endl;

    }





    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.131678350189883x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
 #include <iostream>

 #include <bitset>

 #include <algorithm>

 

 using namespace std;

 

 bitset<10000> cookie[10];

 

 int main() {

    int r;

     int c;

     while (cin >> r >> c && r > 0) {

         int i, j;

         

         for (i = 0; i < r; i++) {

             for (j = 0; j < c; j++) {

                 bool upwards;

                 cin >> upwards;

                 cookie[i][j] = upwards;

             }

         }

         

         int result = 0;

         int permute = 1 << r;

         for (i = 0; i < permute; i++) {

            for (j = 0; j < r; j++) {

             if (i & 1 << j) {

                 cookie[j].flip();

             }

            }

            

            int possibleResult = 0;

            for (int p = 0; p < c; p++) {

             int upCount = 0;

             for (int q = 0; q < r; q++) {

                 if (cookie[q][p]) {

                     upCount++;

                 }

             }

             possibleResult += max(upCount, r - upCount);

            }

            result = max(result, possibleResult);   

             

            for (j = 0; j < r; j++) {

                if (i & 1 << j) {

                    cookie[j].flip();

                }

            }                                

        }

        cout << result << endl;

     }   

     return 0;

 }

// Faster C++ solution for the same problem (measured speedup: 5.175962113973919x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<bitset>

using namespace std;

bitset<10000> cookie[10];

bool now;

int main()

{

	int r,c;

	while(cin>>r>>c && r>0)

	{

		int i,j;

		for(int i=0;i<r;i++)

		{

			for(int j=0;j<c;j++)

			{

				cin>>now;

				cookie[i][j]=now;

			}

		}

		int ans=0;

		for(int i=0;i<(1<<r);i++)

		{

			for(int j=0;j<r;j++)

			{

				if(i & (1<<j))

				{

					cookie[j].flip();

				}

			}

			

			int possible_ans=0;

			for(int j=0;j<c;j++)

			{

				int up_cookie=0;

				for(int k=0;k<r;k++)

				{

					if(cookie[k][j])

					up_cookie++;

				}

				possible_ans+=max(up_cookie,r-up_cookie); 

			}

			ans=max(ans,possible_ans);

			

			for(int j=0;j<r;j++)

			{

				if(i & (1<<j))

				{

					cookie[j].flip();

				}

			}

			

		}

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

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.157223496411226x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
//

// Created by Tnecesoc on 2017/4/14.

//



#include <stdio.h>

#include <bitset>



using namespace std;



const int MAX_R = 20;

const int MAX_C = 10000 + 10;



int field[MAX_R][MAX_C];



bitset<MAX_C> toast[MAX_R];



void solve(int fr, int r, int c, int &min) {



    if (fr >= r) {



        int sum = 0;



        for (int i = 0; i < c; ++i) {

            int row_sum = 0;

            for (int j = 0; j < r; ++j) {

                if (toast[j][i]) {

                    row_sum++;

                }

            }



            sum += row_sum < r - row_sum ? row_sum : r - row_sum;

        }



        if (min > sum) {

            min = sum;

        }



        return;

    } else {



        solve(fr + 1, r, c, min);



        toast[fr].flip();



        solve(fr + 1, r, c, min);



    }



}



int main() {

    

    int r, c;

    while (~scanf("%d %d", &r, &c), r | c) {

        for (int i = 0; i < r; ++i) {

            for (int j = 0; j < c; ++j) {

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

                toast[i].set((size_t) j, (bool) field[i][j]);

            }

        }



        int ans = 0x7fffffff;

        solve(0, r, c, ans);

        printf("%d\n", r * c - ans);

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.764439589912156x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <vector>

#include <queue>

#include <string>

#include <cmath>

#include <sstream>

#include <algorithm>



using namespace std;

vector<vector<int> > senbei;

int H, W;





int main() {

	while (1) {

		cin >> H >> W;

		if (H + W == 0) break;

		senbei.resize(H);

		vector<int> b;

		b.resize(H);

		for (int i = 0; i < H; i++) {

			senbei[i].resize(W);

			b[i] = 0;

		}

		for (int i = 0; i < H; i++) {

			for (int j = 0; j < W; j++) {

				cin >> senbei[i][j];

			}

		}

		int H2 = pow(2, H);

		int max = -1;

		

		for (int i = 0; i < H2; i++) {

			if (i != 0) {

				for (int j = 0; j < b.size(); j++) {

					if (b[j] == 0) {

						b[j] = 1;

						break;

					}

					else {

						b[j] = 0;

					}

				}

			}

			int count = 0;



			for (int k = 0; k < W; k++) {

				int omote = 0, ura = 0;

				for (int j = 0; j < H; j++) {

					if (b[j] == senbei[j][k]) omote++;

				}

				count += omote > H-omote ? omote : H-omote;

			}

			if (max < count) max = count;

		}

		cout << max << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2126302743535735x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

#include<map>

#include<string>

#include<sstream>

#include<vector>

#include<cmath>

#include<set>

#include <bitset>

using namespace std;

const int maxn=10015,inf=0x3f3f3f3f;

int r,c,ans;

bitset<maxn> cookie[10];



void dfs(int step){	

	if(step==r){

		int sum=0,csum=0;

		for(int i=0;i<c;i++){

			for(int j=0;j<r;j++){

				csum+=cookie[j][i];

			}

			sum=sum+max(csum,r-csum);

			csum=0;

		}

		ans=max(ans,sum);

		return;//attenion return

	}

	cookie[step].flip();

	dfs(step+1);

	cookie[step].flip();

	dfs(step+1);

	

}

int main()

{

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

	while(cin>>r>>c&&r&&c){

		for(int i=0;i<r;i++){

			for(int j=0;j<c;j++){

				bool val;

				cin>>val;

				cookie[i][j]=val;

			}

		}

		ans=0;

		dfs(0);

		cout<<ans<<endl;

	}

	//fclose(stdin);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.17018738296274x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

using namespace std;

int m, n, ans = 0, temp;

int a[15][10005];

void dfs(int d)

{

	int up;

	if (d == m)

	{

		temp = 0;

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

		{

			up = 0;

			for (int i = 0; i < m; i++)

				if (a[i][j])

					up++;

			temp += max(up, m - up);

		}

		ans = max(ans, temp);

		return;

	}

	dfs(d + 1);

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

		if (a[d][j])

			a[d][j] = 0;

		else

			a[d][j] = 1;

	dfs(d + 1);

}

int main(void)

{

	while (cin >> m >> n)

	{

		if (!m)

			break;

		for (int i = 0; i < m; i++)

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

				cin >> a[i][j];

		dfs(1);

		cout << ans << endl;

	}

	

}

// Faster C++ solution for the same problem (measured speedup: 5.140791424263087x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <bitset>

#include <algorithm>

using namespace std;

int R, C, t, ans;

bitset<10005>b[15];



/*首先，翻?行列的次序不影??果，因?行的范??小，可以枚?所有行状?，即把行先翻?完?，

?于??行状?，在?列中??最?解，?行列翻?，即判断0多?是1多,1多?相当于不翻??列，

0多相当于翻??列，因此用bitset容器方便?理。*/

void dfs(int k)

{

    if(k == R)

    {

        int tmp = 0;

        for(int i=0; i<C; i++)

        {

            int num = 0;

            for(int j=0; j<R; j++)

                if(b[j][i]) num++;

            tmp += max(num, R-num);

        }

        ans = max(ans, tmp);

        return;

    }

    dfs(k+1);

    b[k].flip();

    dfs(k+1);

    //b[k].flip();

}



int main()

{

    while(~scanf("%d%d",&R,&C),R+C)

    {

        ans = -1;

        for(int i=0; i<R; i++)

            for(int j=0; j<C; j++)

            {

                scanf("%d",&t);

                b[i][j] = t;

            }

        dfs(0);

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

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.093900249167754x):
#include <cstdio>

#include <algorithm>

using namespace std;

int M[15][10005];

int r, c, ans;

void Dfs(int now){

    if(now == r){

        int res = 0;

        for(int i = 0; i < c; i++){

            int on = 0;

            for(int j = 0; j < r; j++)

                if(M[j][i] == 1) on++;

            res += max(on, r - on);

        }

        ans = max(ans, res);

        return ;

    }

    Dfs(now + 1);

    for(int i = 0; i < c; i++)

        M[now][i] = 1 - M[now][i];

    Dfs(now + 1);

}

int main(){

    while(~scanf("%d%d",&r, &c)){

        if(!r && !c) break;

        for(int i = 0; i < r; i++)

            for(int j = 0; j < c; j++)

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

        ans = 0; Dfs(0);

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

    }



    return 0;

}