#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
const int maxn=10001;
int m,n,t,v1[maxn],w1[maxn],v2[maxn],w2[maxn],f[maxn];
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",&v1[i],&w1[i],&v2[i],&w2[i]);
	for(int i=1;i<=n;i++)
	  for(int j=m-min(w1[i],w2[i]);j>=0;j--)
	  {
	    f[j+w2[i]]=max(f[j]+v2[i],f[j+w2[i]]);
	    f[j+w1[i]]=max(f[j]+v1[i],f[j+w1[i]]);
	  }
	printf("%d",f[m]+t);
	return 0;
}