#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int SUM = 0, ff = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    SUM = (SUM << 3) + (SUM << 1) + (ch ^ 48);
    ch = getchar();
  }
  return SUM * ff;
}
const int N = 100010;
struct node {
  int x, len, q;
  int l, r;
} a[N];
int n, K;
int q[N], tot;
long long ans;
int BIT[N];
inline void modify(int x, int val) {
  for (; x <= n; x += x & -x) BIT[x] += val;
}
inline int query(int x) {
  int res = 0;
  for (; x; x -= x & -x) res += BIT[x];
  return res;
}
inline int ask(int l, int r) { return query(r) - query(l - 1); }
inline bool cmp1(node a1, node a2) { return a1.len > a2.len; }
inline bool cmp2(node a1, node a2) { return a1.q < a2.q; }
inline void CDQsolve(int l, int r) {
  if (l == r) return;
  int mid = (l + r) >> 1;
  CDQsolve(l, mid);
  CDQsolve(mid + 1, r);
  int L = l, R = l - 1;
  for (int i = mid + 1; i <= r; i++) {
    while (L <= mid && a[i].q - a[L].q > K) modify(a[L].x, -1), L++;
    while (R < mid && a[R + 1].q - a[i].q <= K) ++R, modify(a[R].x, 1);
    ans += ask(a[i].l, a[i].r);
  }
  for (int i = L; i <= R; i++) modify(a[i].x, -1);
  sort(a + l, a + r + 1, cmp2);
}
int main() {
  n = read(), K = read();
  for (int i = 1; i <= n; i++) {
    a[i].x = read(), a[i].len = read(), a[i].q = read();
    q[++tot] = a[i].x;
  }
  sort(q + 1, q + tot + 1);
  tot = unique(q + 1, q + tot + 1) - q - 1;
  for (int i = 1; i <= n; i++) {
    a[i].l = lower_bound(q + 1, q + tot + 1, a[i].x - a[i].len) - q;
    a[i].r = upper_bound(q + 1, q + tot + 1, a[i].x + a[i].len) - q - 1;
    a[i].x = lower_bound(q + 1, q + tot + 1, a[i].x) - q;
  }
  sort(a + 1, a + n + 1, cmp1);
  CDQsolve(1, n);
  printf("%lld\n", ans);
  return 0;
}
