ACboy needs your help-分组背包模板题

/*
Author: 2486
Memory: 1456 KB		Time: 93 MS
Language: G++		Result: Accepted
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int maxn=100+5;
int dp[maxn],a[maxn][maxn];
int n,m;
int main() {
    while(~scanf("%d%d",&n,&m),n&&m) {
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=m; j++) {
                scanf("%d",&a[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        int Max=0;
        for(int i=1; i<=n; i++) {
            for(int k=m; k>=0; k--) {
                for(int j=1; j<=m; j++) {
                    if(k-j<0)break;
                    dp[k]=max(dp[k],dp[k-j]+a[i][j]);
                }
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}