#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 2010
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
using namespace std;
int n,maxp,w,ans,a[MAXN],b[MAXN],as[MAXN],bs[MAXN],q[MAXN],f[MAXN][MAXN];
inline int read(){
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int main(){
n=read(); maxp=read(); w=read(); memset(f,-10,sizeof(f));
for(int i=1;i<=n;++i) a[i]=read(),b[i]=read(),as[i]=read(),bs[i]=read();
for(int i=1;i<=n;++i){
for(int j=0;j<=as[i];j++) f[i][j]=-a[i]*j;
for(int j=0;j<=maxp;++j) cmax(f[i][j],f[i-1][j]);
if(i-w-1<0) continue;
int head=0,tail=0;
for(int j=0;j<=maxp;++j){
while(head<tail&&q[head]<j-as[i]) ++head;
while(head<tail&&f[i-w-1][j]+j*a[i]>=f[i-w-1][q[tail-1]]+q[tail-1]*a[i]) --tail;
q[tail++]=j;
if(head<tail) cmax(f[i][j],f[i-w-1][q[head]]-a[i]*(j-q[head]));
}
head=0,tail=0;
for(int j=maxp;j>=0;--j){
while(head<tail&&q[head]>j+bs[i]) ++head;
while(head<tail&&f[i-w-1][j]+j*b[i]>=f[i-w-1][q[tail-1]]+q[tail-1]*b[i]) --tail;
q[tail++]=j;
if(head<tail) cmax(f[i][j],f[i-w-1][q[head]]+b[i]*(q[head]-j));
}
}
for(int i=0;i<=maxp;++i) cmax(ans,f[n][i]);
printf("%d\n",ans);
return 0;
}