#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 1e6 + 5;
int n, m, k;
int d[maxn];
int f[maxn];
int t[maxn];
int c[maxn];
long long mn[maxn];
long long tot;
long long prf[maxn];
long long suf[maxn];
void solve() {
  scanf("%d%d%d", &n, &m, &k);
  vector<pair<pair<int, int>, pair<int, int> > > v;
  for (int i = (0); i < (m); i++) {
    scanf("%d%d%d%d", d + i, f + i, t + i, c + i);
    v.push_back(make_pair(make_pair(d[i], f[i]), make_pair(t[i], c[i])));
  }
  sort((v).begin(), (v).end());
  for (int i = (0); i < (m); i++) {
    d[i] = v[i].first.first;
    f[i] = v[i].first.second;
    t[i] = v[i].second.first;
    c[i] = v[i].second.second;
  }
  fill_n(mn, n + 1, (long long)1e12);
  tot = accumulate(mn + 1, mn + n + 1, 0LL);
  int ptr = 0;
  for (int i = (0); i < (maxn); i++) {
    prf[i] = tot;
    while (ptr < m && d[ptr] <= i) {
      if (!t[ptr]) {
        if (mn[f[ptr]] > c[ptr]) {
          tot -= mn[f[ptr]];
          mn[f[ptr]] = c[ptr];
          tot += mn[f[ptr]];
        }
      }
      ptr++;
    }
  }
  fill_n(mn, n + 1, (long long)1e12);
  tot = accumulate(mn + 1, mn + n + 1, 0LL);
  ptr = m - 1;
  for (int i = (maxn)-1; i >= (0); i--) {
    suf[i] = tot;
    while (ptr >= 0 && d[ptr] >= i) {
      if (!f[ptr]) {
        if (mn[t[ptr]] > c[ptr]) {
          tot -= mn[t[ptr]];
          mn[t[ptr]] = c[ptr];
          tot += mn[t[ptr]];
        }
      }
      ptr--;
    }
  }
  long long ans = (long long)1e12;
  for (int i = (0); i < (maxn - k + 1); i++) {
    chkmin(ans, prf[i] + suf[i + k - 1]);
  }
  if (ans == (long long)1e12) {
    ans = -1;
  }
  cout << ans << "\n";
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
