1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 const int MAX = 110;
 7 int n,m;
 8 int dp[MAX],a[MAX][MAX];
 9 int main()
10 {
11     while(scanf("%d%d", &n, &m) != EOF)
12     {
13         if(n == 0 && m == 0)
14             break;
15         for(int i = 1; i <= n; i++)
16             for(int j = 1; j <= m; j++)
17                 scanf("%d", &a[i][j]);
18         memset(dp, 0, sizeof(dp));
19         for(int i = 1; i <= n; i++)
20         {
21             for(int j = m; j > 0; j--)
22             {
23                 for(int k = 1; k <=m; k++)
24                 {
25                     if(j >= k)
26                     dp[j] = max(dp[j], dp[j - k] + a[i][k]);
27                 }
28             }
29         }
30         printf("%d\n", dp[m]);
31     }
32     return 0;
33 }