In the last mission, MDCS has successfully shipped N AI robots to Mars. Before they start exploring, system initialization is required so they are arranged in a line. Every robot can be described with three numbers: position (x_i), radius of sight (r_i) and IQ (q_i).

Since they are intelligent robots, some of them will talk if they see each other. Radius of sight is inclusive, so robot can see other all robots in range [x_i - r_i, x_i + r_i]. But they don't walk to talk with anybody, but only with robots who have similar IQ. By similar IQ we mean that their absolute difference isn't more than K. 

Help us and calculate how many pairs of robots are going to talk with each other, so we can timely update their software and avoid any potential quarrel.

Input

The first line contains two integers, numbers N (1 ≤ N ≤ 10^5)  and K (0 ≤ K ≤ 20).

Next N lines contain three numbers each x_i, r_i, q_i (0 ≤ x_i,r_i,q_i ≤ 10^9) — position, radius of sight and IQ of every robot respectively.

Output

Output contains only one number — solution to the problem.

Example

Input

3 2
3 6 1
7 3 10
10 5 8


Output

1

Note

The first robot can see the second, but not vice versa. The first robot can't even see the third. The second and the third robot can see each other and their IQs don't differ more than 2 so only one conversation will happen.
#include <bits/stdc++.h>
using namespace std;
char ch, B[1 << 20], *S = B, *T = B;
long long aa, bb;
long long rd() {
  while (ch = (S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T)
                   ? 0
                   : *S++),
         !(ch >= '0' && ch <= '9') && ch != '-')
    ;
  ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
  while (ch = (S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T)
                   ? 0
                   : *S++),
         (ch >= '0' && ch <= '9'))
    aa = aa * 10 + ch - '0';
  return bb ? aa : -aa;
}
const long long MAXN = 1e5 + 10;
long long n, k, ans, b[MAXN], tr[MAXN];
struct Node {
  long long pos, l, r, q, len;
} a[MAXN];
bool cmp1(Node a, Node b) { return a.len > b.len; }
bool cmp2(Node a, Node b) { return a.q < b.q; }
inline void add(long long x, long long c) {
  while (x <= n) {
    tr[x] += c;
    x += (x & (-x));
  }
}
long long sum(long long x) {
  long long ret = 0;
  while (x) {
    ret += tr[x];
    x -= (x & (-x));
  }
  return ret;
}
long long query(long long l, long long r) { return sum(r) - sum(l - 1); }
inline void cdq(long long l, long long r) {
  if (l == r) return;
  long long mid = (l + r) >> 1;
  cdq(l, mid);
  cdq(mid + 1, r);
  long long L = l, R = l - 1;
  for (register long long i = mid + 1; i <= r; ++i) {
    while (L <= mid && a[i].q - a[L].q > k) {
      add(a[L].pos, -1);
      ++L;
    }
    while (R < mid && a[R + 1].q - a[i].q <= k) {
      ++R;
      add(a[R].pos, 1);
    }
    ans += query(a[i].l, a[i].r);
  }
  for (register long long i = L; i <= R; ++i) add(a[i].pos, -1);
  sort(a + l, a + r + 1, cmp2);
}
inline void work() {
  n = rd();
  k = rd();
  for (register long long i = 1; i <= n; ++i) {
    a[i].pos = rd();
    a[i].len = rd();
    a[i].q = rd();
    b[i] = a[i].pos;
  }
  sort(b + 1, b + n + 1);
  long long cnt = unique(b + 1, b + n + 1) - b - 1;
  for (register long long i = 1; i <= n; ++i) {
    a[i].l = lower_bound(b + 1, b + cnt + 1, a[i].pos - a[i].len) - b;
    a[i].r = upper_bound(b + 1, b + cnt + 1, a[i].pos + a[i].len) - b - 1;
    a[i].pos = lower_bound(b + 1, b + cnt + 1, a[i].pos) - b;
  }
  sort(a + 1, a + n + 1, cmp1);
  cdq(1, n);
  printf("%lld\n", ans);
}
signed main() {
  work();
  return 0;
}
