#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m,l;
vector<pii> koma[52];
int dp[52][52];

int main(){
  scanf("%d%d%d",&n,&m,&l);
  REP(i,m){
    int d,a,k,t;
    scanf("%d%d%d%d",&d,&a,&k,&t);
    int id = d*n+a-1;
    koma[id].push_back(pii(k,t));
  }
  REP(i,5*n){
    REP(x,l+1){
      REP(j,koma[i].size()){
        int k = koma[i][j].first;
        int t = koma[i][j].second;
        CHMAX(dp[i+k][x+1],dp[i][x]+t);
      }
      CHMAX(dp[i+1][x],dp[i][x]);
    }
  }
  int ans = 0;
  REP(x,l+1)CHMAX(ans,dp[5*n][x]);
  printf("%d\n",ans);
  return 0;
}