1 #include<bits/stdc++.h>
 2 #define F(i,a,b) for(int i=a;i<=b;++i)
 3 using namespace std;
 4 typedef long long ll;
 5
 6 const int N=1e5+7;
 7 const ll inf=1ll<<61;
 8 int n,m,k;
 9 ll dp[N*10][2],val[N];
10 struct Node
11 {
12     int day,op,aim,cost;
13     Node(int a=0,int b=0,int c=0,int d=0):day(a),op(b),aim(c),cost(d){}
14     bool operator<(const Node &B)const{return day<B.day;}
15 }a[N];
16
17 int main(){
18     scanf("%d%d%d",&n,&m,&k);
19     F(i,1,m)
20     {
21         int aa,b,c,d;
22         scanf("%d%d%d%d",&aa,&b,&c,&d);
23         if(c==0)a[i]=Node(aa,0,b,d);
24         else a[i]=Node(aa,1,c,d);
25     }
26     sort(a+1,a+1+m);
27     F(i,1,n)val[i]=inf;
28     int ed=1,cnt=0;ll sum=0;
29     F(i,1,1000000)
30     {
31         while(ed<=m&&i>=a[ed].day)
32         {
33             if(a[ed].op){ed++;continue;}
34             if(val[a[ed].aim]==inf)
35             {
36                 cnt++,val[a[ed].aim]=a[ed].cost;
37                 sum+=a[ed].cost;
38             }
39             else if(val[a[ed].aim]>a[ed].cost)
40             {
41                 sum+=a[ed].cost-val[a[ed].aim];
42                 val[a[ed].aim]=a[ed].cost;
43             }
44             ed++;
45         }
46         if(cnt==n)dp[i][0]=sum;
47         else dp[i][0]=inf;
48     }
49     ed=m,cnt=0,sum=0;
50     F(i,1,n)val[i]=inf;
51     for(int i=1000000;i>=1;i--)
52     {
53         while(ed>=1&&i<=a[ed].day)
54         {
55             if(!a[ed].op){ed--;continue;}
56             if(val[a[ed].aim]==inf)
57             {
58                 cnt++,val[a[ed].aim]=a[ed].cost;
59                 sum+=a[ed].cost;
60             }
61             else if(val[a[ed].aim]>a[ed].cost)
62             {
63                 sum+=a[ed].cost-val[a[ed].aim];
64                 val[a[ed].aim]=a[ed].cost;
65             }
66             ed--;
67         }
68         if(cnt==n)dp[i][1]=sum;
69         else dp[i][1]=inf;
70     }
71     ll ans=inf;
72     F(i,1,1000000)
73     {
74         if(i+k+1>1000000)continue;
75         ans=min(ans,dp[i][0]+dp[i+k+1][1]);
76     }
77     printf("%lld\n",ans==inf?-1:ans);
78     return 0;
79 }