#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=110;
int dp[N][N];
int a[N][N];
int ans[N];
int main(){
int n,m;scanf("%d%d",&m,&n);
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
scanf("%d",&a[i][j]);
}
}
memset(dp,-0x3f,sizeof dp);
dp[0][0]=0;
for(int i=1;i<=n;i++){
for(int j=0;j<=min(i,m);j++){
dp[i][j]=dp[i-1][j];
if(j>0) dp[i][j]=max(dp[i-1][j-1]+a[j][i],dp[i][j]);
}
}
printf("%d\n",dp[n][m]);
vector<int> ans;
int i=n,j=m;
while(j){
while(dp[i-1][j]==dp[i][j]) i--;
ans.push_back(i);
j--;
i--;
}
for(int i=ans.size()-1;i>=0;i--){
i==0?printf("%d\n",ans[i]):printf("%d ",ans[i]);
}
return 0;
}