//conditional max_search on column


#include <iostream>

using namespace std;



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

struct fmker{
    bool van;
    int fjind, fmaxert;
};

fmker fmaxker(const int v[50][50], int & n, int & m);

int fmax(const int v[50][50], int & n, int & m, int & fmaxert, bool & van);

int sum_col(const int v[50][50], int & n, int j);

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;
   }


      fmker result=fmaxker(t,n, m);

    if(result.van)
    {
       cout<<" There is such a column "<<endl;
       cout<<result.fmaxert<<endl;
       cout<<" its position is: "<<result.fjind<<endl;
    }
    else
       cout<<"There was no such column! "<<endl;

 int fmaxert, fjind;
bool van;

fjind=fmax(t,n,m, fmaxert,van);
  if(van)
    {
       cout<<" There is such a column - in int fun.: "<<endl;
       cout<<" its position is: "<<fjind<<endl;
      cout<<"its value is: "<<fmaxert<<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)<= "<<50<< ")  "<<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];
            }
         }

}


fmker fmaxker(const int x[50][50], int & n, int & m)
{
      fmker a;
      a.van=false;

  for(int j=0; j<m; ++j)
{
         if(x[0][j]>=0 && x[1][j]<=0) {}

         if(x[0][j]<0 && x[1][j]>0 && !a.van )
         {
          a.van=true;
          a.fmaxert=sum_col(x,n,j);
          a.fjind=j;

         }
        if(x[0][j]<0 && x[1][j]>0 && a.van )
         {
           if(sum_col(x, n,j)>a.fmaxert)
          {
           a.fmaxert=sum_col(x, n,j);
           a.fjind=j;
          }

         }

}
return a;

}

int fmax(const int x[50][50], int & n, int & m, int & fmaxert, bool & van)
{
      int fjind;
      van=false;

  for(int j=0; j<m; ++j)
{
         if(x[0][j]>=0 && x[1][j]<=0) {}

         if(x[0][j]<0 && x[1][j]>0 && !van )
         {
          van=true;
          fmaxert=sum_col(x,n,j);
          fjind=j;

         }
        if(x[0][j]<0 && x[1][j]>0 && van )
         {
           if(sum_col(x, n,j)>fmaxert)
          {
           fmaxert=sum_col(x, n,j);
           fjind=j;
          }

         }

}
return fjind;

}


int sum_col(const int v[50][50], int & n, int j)
{
    int s=0;

    for(int i=0; i<n; ++i)
       {
           s=s+v[i][j];
       }
    return s;
}