#define it <> ::iterator
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
const ll inf=-0x7f7f7f7f;
ll n,maxp,w,f[2001][2001];
struct node{
	ll ap,bp,as,bs;
}a[2001]; 
int main(){
	cin>>n>>maxp>>w;
	for(int i=1;i<=n;i++){
		cin>>a[i].ap>>a[i].bp>>a[i].as>>a[i].bs;
	}
	for(int i=0;i<=n;i++){
		for(int j=0;j<=maxp;j++){
			f[i][j]=j<=a[i].as?-j*a[i].ap:inf;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=0;j<=maxp;j++){
			f[i][j]=max(f[i][j],f[i-1][j]);
			if(i<=w)continue;
			for(int k=j-a[i].as;k<=j;k++){
				if(k<1)continue;
				f[i][j]=max(f[i][j],f[i-w-1][k]-(j-k)*a[i].ap);
				//cout<<f[i][j]<<"&";
			}
			for(int k=j;k<=a[i].bs+j;k++){
				if(k>maxp)continue;
				f[i][j]=max(f[i][j],f[i-w-1][k]+(k-j)*a[i].bp);
				//cout<<f[i][j]<<"*";
			}
			//cout<<endl;
		}
//		for(int i=1;i<=n;i++){
//			for(int j=0;j<=maxp;j++){
//				cout<<f[i][j]<<" ";
//			}
//			cout<<endl;
//		}
//		cout<<endl;
	}
	cout<<f[n][0];
	return 0;
} 

疑惑.jpg