#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define ll long long

 const ll inf=1e15;

 using namespace std;

 inline ll read(){

     ll re=,flag=;char ch=getchar();

     while(ch>''||ch<''){

         if(ch=='-') flag=-;

         ch=getchar();

     }

     while(ch>=''&&ch<='') re=(re<<)+(re<<)+ch-'',ch=getchar();

     return re*flag;

 }

 ll n,m,K,cnta,cntb,cntva,cntvb;

 ll pre[],suf[];ll suma,sumb;

 bool vis[];ll minn[];

 struct flight{

     ll to,cost,t;

 }a[],b[];

 bool cmp(flight l,flight r){

     return l.t<r.t;

 }

 bool cmp2(flight l,flight r){

     return l.t>r.t;

 }

 int main(){

     ll i,j,t1,t2,t3,t4;ll ans=inf;

     n=read();m=read();K=read();

     for(i=;i<=m;i++){

         t1=read();t2=read();t3=read();t4=read();

         if(t2!=) a[++cnta]=(flight){t2,t4,t1};

         else b[++cntb]=(flight){t3,t4,t1};

     }

     if(cnta<n||cntb<n){

         puts("-1");return ;

     }

     sort(a+,a+cnta+,cmp);sort(b+,b+cntb+,cmp2);

     for(i=;i<=n;i++) suma+=(ll)(minn[i]=inf);

     t1=;pre[]=inf;

     for(i=;i<=cnta;i++){

         for(j=t1+;j<a[i].t;j++) pre[j]=pre[j-];

         t1=a[i].t;

         if(!vis[a[i].to]) vis[a[i].to]=,cntva++;

         suma-=minn[a[i].to]-min(minn[a[i].to],a[i].cost);

         minn[a[i].to]=min(minn[a[i].to],a[i].cost);

         if(cntva==n) pre[t1]=suma;

         else pre[t1]=-;

     }

     memset(vis,,sizeof(vis));

     for(i=;i<=n;i++) sumb+=(ll)(minn[i]=inf);

     t1=;suf[t1]=inf;

     for(i=;i<=cntb;i++){

         for(j=t1-;j>b[i].t;j--) suf[j]=suf[j+];

         t1=b[i].t;

         if(!vis[b[i].to]) vis[b[i].to]=,cntvb++;

         sumb-=minn[b[i].to]-min(minn[b[i].to],b[i].cost);

         minn[b[i].to]=min(minn[b[i].to],b[i].cost);

 //        cout<<"calc "<<i<<ends<<t1<<ends<<cntvb<<ends<<sumb<<endl;

         if(cntvb==n) suf[t1]=sumb;

         else suf[t1]=-;

     }

 //    for(i=1;i<=20;i++) cout<<suf[i]<<endl;

     t1--;while(t1) suf[t1]=suf[t1+],t1--;

 //    for(i=1;i<=20;i++) cout<<suf[i]<<endl;

 //    for(i=1;i<=20;i++) cout<<pre[i]<<endl;

     for(i=;i<=cnta;i++){

         t1=a[i].t;t2=t1+K+;

         if(~pre[t1]&&~suf[t2]) ans=min(ans,(ll)pre[t1]+(ll)suf[t2]);

     }

     if(ans>=inf) printf("-1");

     else printf("%I64d\n",ans);

 }