#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<stack>

 #define int long long

 #define maxn 100+10

 #define INF 9223372036854775807

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(int x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int f,v;

 int map[maxn][maxn];

 int dp[maxn][maxn];

 int path[maxn][maxn];

 stack<int> s;

 inline void print(int num,int x)

 {

     if(num==) return;

     s.push(x);

     print(num-,path[num][x]);

 }

 signed main()

 {

     freopen("flower.in","r",stdin);

     freopen("flower.out","w",stdout);

     memset(dp,,sizeof(dp));

     f=read();v=read();

     for(int i=;i<=f;i++)

         for(int j=;j<=v;j++)

             map[i][j]=read();

     for(int i=;i<=v;i++) dp[][i]=map[][i];

     for(int i=;i<=f;i++)

         for(int j=i;j<=v-(f-i);j++)

             for(int k=;k<j;k++)

             {

                 if(dp[i-][k]+map[i][j]>dp[i][j])

                 {

                     dp[i][j]=dp[i-][k]+map[i][j];

                     path[i][j]=k;

                 }

             }

     int ans=-INF,fnum=;

     for(int i=;i<=v;i++)

         if(dp[f][i]>ans)

         {

             ans=dp[f][i];

             fnum=i;

         }

     write(ans);

     printf("\n");

     print(f,fnum);

     while(!s.empty())

     {

         write(s.top());

         printf(" ");

         s.pop();

     }

     return ;

 }