#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int m,n,t,a[205],b[205],c[205],d[205],max1=-1;
long long x[1000000];
int main()
{
	freopen("besta.in","r",stdin);
	freopen("besta.out","w",stdout);
	scanf("%d%d%d",&m,&n,&t);
	for(int i=1;i<=n;i++)scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
	for(int i=0;i<=m;i++)x[i]=0;
	for(int i=1;i<=n;i++)
	for(int j=m;j>=1;j--)
	{
		if(j>b[i])
		if(x[j-b[i]]+a[i]>x[j])x[j]=x[j-b[i]]+a[i];
		if(j>d[i])
		if(x[j-d[i]]+c[i]>x[j])x[j]=x[j-d[i]]+c[i];
	}
	for(int i=1;i<=m;i++)if(max1<x[i])max1=x[i];
	cout<<max1+t;
return 0;
}