#include<iostream>
#include<cstdio>
using namespace std;
int m,n,t,v1[205],w1[205],v2[205],w2[205];
long long int dp[10005];
int main(){
	freopen("besta.in","r",stdin);
	freopen("besta.out","w",stdout);
	cin>>m>>n>>t;
	for(int i=1;i<=n;i++)cin>>v1[i]>>w1[i]>>v2[i]>>w2[i];
	fill(dp,dp+n+1,0);
	for(int k=1;k<=n;k++)
	for(int j=m;j>=0;j--)
	for(int i=1;i<=2;i++)
	if(i==1){if(j>=w1[k])dp[j]=max(dp[j],dp[j-w1[k]]+v1[k]);}
	else {if(j>=w2[k])dp[j]=max(dp[j],dp[j-w2[k]]+v2[k]);}
	cout<<dp[m]+t;
	fclose(stdin);
	fclose(stdout);
	return 0;
}