#include <bits/stdc++.h>
using namespace std;
struct node {
  int p, x, q;
  int l, r;
  friend bool operator<(node a, node b) { return a.x > b.x; }
} a[500005];
bool cmp(node a, node b) { return a.q < b.q; }
int n, len, k;
int s[500005], b[500005];
void add(int x, int k) {
  while (x <= len) s[x] += k, x += ((x) & (-(x)));
}
int query(int x) {
  int res = 0;
  while (x) res += s[x], x -= ((x) & (-(x)));
  return res;
}
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, cmp), sort(a + mid + 1, a + r + 1, cmp);
  int p1 = l, p2 = l;
  for (int i = mid + 1; i <= r; i++) {
    while (p1 <= mid && a[i].q - a[p1].q > k) add(a[p1].p, -1), p1++;
    while (p2 <= mid && a[p2].q - a[i].q <= k) add(a[p2].p, 1), p2++;
    ans += query(a[i].r) - query(a[i].l - 1);
  }
  for (int i = p1; i < p2; i++) {
    add(a[i].p, -1);
  }
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d", &a[i].p, &a[i].x, &a[i].q);
    b[i] = a[i].p;
  }
  sort(b + 1, b + n + 1);
  len = unique(b + 1, b + n + 1) - b - 1;
  for (int i = 1; i <= n; i++) {
    a[i].l = lower_bound(b + 1, b + len + 1, a[i].p - a[i].x) - b;
    a[i].r = upper_bound(b + 1, b + len + 1, a[i].p + a[i].x) - b - 1;
    a[i].p = lower_bound(b + 1, b + len + 1, a[i].p) - b;
  }
  sort(a + 1, a + n + 1);
  solve(1, n);
  cout << ans << endl;
  return 0;
}
