#include <bits/stdc++.h>
using namespace std;
ifstream fin("sobo.in");
ofstream fout("sobo.out");

int main()
{
    ///dp[mask]= cost minim daca sobo smart e cu mask ul asta
    ///ans[p]= o masca a sobolanilor care au bitul p=1
    ///daca raspunsul la intrebarea p e 0, atunci ne vom uita in ((1<<n)-1)^ans[p]
///    -pt fiecare intrebare rezultatul in cazul ala=ask[p]
///   dp[mask]=miN(ask[p]);
///
///    ask[p]=(dp[mask&ans[p]], dp[mask&((1<<n)-1^ans[p]]+cost[p]);
///
    fin>>n>>l;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=l;++j)
        {
            cin>>c;
            ans[1<<j][i]=
        }


    return 0;
}