#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> g;
const int inf=100000000;
int f,v,dp[110][110],a[110][110],d[110][110];
int main(){
scanf("%d%d",&f,&v);
for(int i=1;i<=f;i++){
for(int j=1;j<=v;j++){
scanf("%d",&d[i][j]);
dp[i][j]=-inf;
}
}
dp[0][0]=0;
for(int j=1;j<=v;j++) dp[0][v]=0;
for(int i=1;i<=f;i++){
for(int j=i;j<=v-f+i;j++){
for(int k=i;k<=j;k++){
if(dp[i-1][k-1]+d[i][j]>dp[i][j]){
dp[i][j]=dp[i-1][k-1]+d[i][j];
a[i][j]=k-1;
}
}
}
}
int ans=-100000000,cur;
for(int i=f;i<=v;i++) if(dp[f][i]>ans) ans=dp[f][i],cur=i;
cout<<ans<<endl;
int now=f,now1=v,now2=cur;
//cout<<2<<endl;
while(now2!=0){
g.push_back(now2);
if(now<=0) break;
now2=a[now][now2];
--now;
}
//cout<<1<<endl;
reverse(g.begin(),g.end());
for(int i=0;i<g.size();i++){
printf("%d ",g[i]);
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> g;
const int inf=100000000;
int f,v,dp[110][110],a[110][110],d[110][110];
int main(){
scanf("%d%d",&f,&v);
for(int i=1;i<=f;i++){
for(int j=1;j<=v;j++){
scanf("%d",&d[i][j]);
dp[i][j]=-inf;
}
}
dp[0][0]=0;
for(int j=1;j<=v;j++) dp[0][v]=0;
for(int i=1;i<=f;i++){
for(int j=i;j<=v-f+i;j++){
for(int k=i;k<=j;k++){
if(dp[i-1][k-1]+d[i][j]>dp[i][j]){
dp[i][j]=dp[i-1][k-1]+d[i][j];
a[i][j]=k-1;
}
}
}
}
int ans=-100000000,cur;
for(int i=f;i<=v;i++) if(dp[f][i]>ans) ans=dp[f][i],cur=i;
cout<<ans<<endl;
int now=f,now1=v,now2=cur;
//cout<<2<<endl;
while(now2!=0){
g.push_back(now2);
if(now<=0) break;
now2=a[now][now2];
--now;
}
//cout<<1<<endl;
reverse(g.begin(),g.end());
for(int i=0;i<g.size();i++){
printf("%d ",g[i]);
}
return 0;
}