#include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 int L, N, B;

 int f[][];

 inline int read()

 {

     int x = , f = ;

     char ch = getchar();

     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;

     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';

     return x * f;

 }

 struct node

 {

     int x, w, f, c;

 }p[];

 inline bool cmp(node x, node y)

 {

     return x.x < y.x;

 }

 inline int max(int x, int y)

 {

     return x > y ? x : y;

 }

 int main()

 {

     int i, j;

     L = read();

     N = read();

     B = read();

     for(i = ; i <= N; i++)

     {

         p[i].x = read();

         p[i].w = read();

         p[i].f = read();

         p[i].c = read();

         p[i].w += p[i].x;

     }

     std::sort(p + , p + N + , cmp);

     memset(f, -, sizeof(f));

     for(i = ; i <= B; i++) f[][i] = ;

     for(i = ; i <= N; i++)

         for(j = B; j >= p[i].c; j--)

             if(f[p[i].x][j - p[i].c] ^ -)

                 f[p[i].w][j] = max(f[p[i].w][j], f[p[i].x][j - p[i].c] + p[i].f);

     printf("%d\n", f[L][B]);

     return ;

 }