#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
int read(){char c;int s=0,t=1;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
const int maxn=100010;
const double eps=1e-10,inf=1000000000000;
int s[maxn],n,m;
ll f[maxn];
struct cyc{int d,p,r,g,id,x;ll y;}a[maxn],b[maxn];
bool cmp(cyc a,cyc b){return -a.d<-b.d;}
double slope(int A,int B){if(a[A].x==a[B].x){if(a[B].y<a[A].y)return inf;else return -inf;}return 1.0*(a[A].y-a[B].y)/(a[A].x-a[B].x);
}
void CDQ(int l,int r){if(l==r){f[l]=max(f[l-1],f[l]);a[l].x=a[l].g;a[l].y=f[l]-a[l].p+a[l].r-1ll*a[l].g*(a[l].d+1);if(f[l]<a[l].p)a[l].g=-1;return;}int mid=(l+r)>>1;int x1=l-1,x2=mid;for(int i=l;i<=r;i++)if(a[i].id<=mid)b[++x1]=a[i];else b[++x2]=a[i];for(int i=l;i<=r;i++)a[i]=b[i];CDQ(l,mid);int top=0;for(int i=l;i<=mid;i++)if(~a[i].g){while(top>1&&slope(s[top],i)<slope(s[top-1],s[top]))top--;s[++top]=i;}int x=1;for(int i=mid+1;i<=r;i++){while(x<top&&slope(s[x],s[x+1])<-a[i].d)x++;if(x<=top)f[a[i].id]=max(f[a[i].id],a[s[x]].y+1ll*a[s[x]].g*a[i].d);}CDQ(mid+1,r);x1=l,x2=mid+1;for(int i=l;i<=r;i++){if(x1==mid+1)b[i]=a[x2++];elseif(x2==r+1)b[i]=a[x1++];elseif(a[x1].g>a[x2].g)b[i]=a[x1++];else b[i]=a[x2++];}for(int i=l;i<=r;i++)a[i]=b[i];
}
int main(){n=read();f[0]=read();m=read();int T=0;while(n||f[0]||m){T++;for(int i=1;i<=n;i++)a[i].d=read(),a[i].p=read(),a[i].r=read(),a[i].g=read();sort(a+1,a+n+1,cmp);for(int i=1;i<=n;i++)a[i].id=n-i+1;a[++n]=(cyc){m+1,0,0,0,n,0,0};sort(a+1,a+n+1,cmp);for(int i=1;i<=n;i++)f[i]=0;CDQ(1,n);printf("Case %d: %lld\n",T,f[n]);n=read();f[0]=read();m=read();}return 0;
}