#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, m, k, d, bl[1000005], blr[1000005], don, donr;
long long int f[1000005], r[1000005], cum[1000005], cumr[1000005], tot;
struct T {
  int u, v, w;
};
T a;
vector<T> v[1000005];
int main() {
  cin >> n >> m;
  scanf("%d", &k);
  for (__typeof(n) i = (1); i <= (n); i++) bl[i] = blr[i] = 10000000;
  for (__typeof(1000001) i = (0); i <= (1000001); i++)
    cum[i] = 1000000000000000000LL, cumr[i] = 1000000000000000000LL;
  for (__typeof(m) i = (1); i <= (m); i++) {
    scanf("%d", &d);
    scanf("%d %d", &a.u, &a.v);
    scanf("%d", &a.w);
    v[d].push_back(a);
  }
  for (int i = 1; i <= 1000000; i++) {
    for (int j = 0; j < (int)v[i].size(); j++) {
      a = v[i][j];
      if (a.u != 0) {
        if (bl[a.u] == 1e7) don++;
        if (bl[a.u] > a.w) {
          if (bl[a.u] != 1e7) tot -= bl[a.u];
          bl[a.u] = a.w;
          tot += bl[a.u];
        }
      }
    }
    if (don >= n) {
      f[i] = tot;
      cum[i] = f[i];
    }
    cum[i] = min(cum[i], cum[i - 1]);
  }
  tot = 0;
  for (int i = 1000000; i >= 1; i--) {
    for (int j = 0; j < (int)v[i].size(); j++) {
      a = v[i][j];
      if (a.u == 0) {
        if (blr[a.v] == 1e7) donr++;
        if (blr[a.v] > a.w) {
          if (blr[a.v] != 1e7) tot -= blr[a.v];
          blr[a.v] = a.w;
          tot += blr[a.v];
        }
      }
    }
    if (donr >= n) {
      r[i] = tot;
      cumr[i] = r[i];
    }
    cumr[i] = min(cumr[i], cumr[i + 1]);
  }
  tot = 1000000000000000000LL;
  for (int i = 1; i <= 1000000; i++) {
    if (i + k + 1 <= 1000000) {
      tot = min(tot, cum[i] + cumr[i + k + 1]);
    }
  }
  if (tot >= 1000000000000000000LL) tot = -1;
  cout << tot, printf("\n");
  return 0;
}
