#include<bits/stdc++.h>
using namespace std;
int a[105][105];
int dp[105][105];
int pre[105];
int n,m;
struct as{
	int c[105];
	int y; 
};
as b[105][105];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	memset(dp,-127,sizeof(dp));
	for(int i=0;i<=m;i++){
		dp[0][i]=0;
	}
	for(int i=1;i<=n;i++){
		for(int j=i;j<=m;j++){
			if(dp[i-1][j-1]+a[i][j]>dp[i][j-1]){
				b[i][j]=b[i-1][j-1];
				b[i][j].c[++b[i][j].y]=j;
				dp[i][j]=dp[i-1][j-1]+a[i][j];
			}else{
				b[i][j]=b[i][j-1];
				dp[i][j]=dp[i][j-1];
			}
		}
	}
	cout<<dp[n][m]<<endl;
	for(int i=1;i<=b[n][m].y;i++){
		cout<<b[n][m].c[i]<<" ";
	}
	return 0;
}

为什么25行是>dp[i][j-1],而不是>dp[i][j]?