#include<bits/stdc++.h> using namespace std; int m,n,c; int f[101]; int main(){ scanf("%d%d",&n,&m); while(m!=0 and n!=0){ memset(f,0,sizeof(f)); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ scanf("%d",&c); for(int k=m;k>=j;k--){ f[k]=max(f[k-j]+c,f[k]); } } } printf("%d\n",f[m]); scanf("%d%d",&n,&m); } }