#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
int n, m, c[100005 * 3];
struct node {
  int x, f, L, R;
} a[100005];
int b[100005 * 3], tot;
bool cmp1(const node &a, const node &b) { return a.R - a.x > b.R - b.x; }
bool cmp2(const node &a, const node &b) { return a.f < b.f; }
void Add(int x, int d) {
  for (; x <= tot; x += x & -x) c[x] += d;
}
int sum(int x) {
  if (x <= 0) return 0;
  int s = 0;
  for (; x; x -= x & -x) s += c[x];
  return s;
}
long long ans;
void solve(int l, int r) {
  if (l == r) return;
  int mid = l + r >> 1;
  solve(l, mid);
  solve(mid + 1, r);
  sort(a + l, a + mid + 1, cmp2);
  sort(a + mid + 1, a + r + 1, cmp2);
  int L = l, R = l - 1;
  for (int i = mid + 1; i <= r; ++i) {
    while (R < mid && a[R + 1].f - a[i].f <= m) R++, Add(a[R].x, 1);
    while (L <= mid && a[i].f - a[L].f > m) Add(a[L].x, -1), L++;
    ans += sum(a[i].R) - sum(a[i].L - 1);
  }
  for (int i = L; i <= R; ++i) Add(a[i].x, -1);
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; ++i) {
    int x = read(), r = read(), f = read();
    a[i] = (node){x, f, x - r, x + r};
    b[++tot] = a[i].R, b[++tot] = a[i].L, b[++tot] = a[i].x;
  }
  sort(b + 1, b + tot + 1);
  tot = unique(b + 1, b + tot + 1) - b - 1;
  sort(a + 1, a + n + 1, cmp1);
  for (int i = 1; i <= n; ++i)
    a[i].L = lower_bound(b + 1, b + tot + 1, a[i].L) - b,
    a[i].R = lower_bound(b + 1, b + tot + 1, a[i].R) - b,
    a[i].x = lower_bound(b + 1, b + tot + 1, a[i].x) - b;
  solve(1, n);
  cout << ans;
}
