//conditional max_search on column


#include <iostream>

using namespace std;



void read(int v[50][50], int &, int &);

struct opt_search{
    bool there_is;
    int o_ind;
};

opt_search  search(const int v[50][50], int & n, int & m);



int main()
{

    int n, m;
    int t[50][50];

    read(t,n,m);

   cout<<" the elements of the matrix: "<<endl;

    for(int i=0; i<n; ++i)
   {
      for(int j=0; j<m; ++j)
        cout<<t[i][j]<<" ";
        cout<<endl;
   }


      opt_search   result=search(t,n, m);

    if(result.there_is)
    {
       cout<<" There is such a column "<<endl;

       cout<<" its position is the column: "<<result.o_ind<<endl;
    }
    else
       cout<<"There was no such column! "<<endl;


    return 0;
}

void read(int v[50][50], int & n, int & m)
{


 cout<<" how many rows and columns?  (between: 1<=(m, n)<= 30)  "<<endl;
   do
   {
     cin>>n>>m;

     if(n<=1 || n>50 || m<=1 || m>50)
     cout<<"not good, give it again:  "<<endl;
   }while(n<=1 || n>50 || m<=1 || m>50);

         //fill the matrix

         cout<<" give the values: "<<endl;

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

             for(int j = 0; j<m; ++j)
            {
             cin >> v[i][j];
            }
         }

}


opt_search  search(const int x[50][50], int & n, int & m)
{
      opt_search a;
      a.there_is=false;

  int j=0;
  while( j<m && !a.there_is)
{
       bool all_one=true;
       int i=0;
       while( i<n && all_one)
        {
         all_one=(x[i][j]==1);
         ++i;
        }
        
       if(i>n) 
        a.there_is=true;

     j++;
  }

 a.o_ind=j;

return a;

}