Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int maxm = (maxn << 2) + 2e6;
struct Node {
  int x, r, q;
  bool operator<(const Node &A) const { return r > A.r; }
};
Node a[maxn];
map<int, int> Hashq, Hashx;
int root[maxn];
long long sum[maxm];
int lch[maxm], rch[maxm];
int dfn;
void build(int &k, int l, int r) {
  k = ++dfn;
  sum[k] = 0;
  if (l == r) return;
  int mid = l + r >> 1;
  build(lch[k], l, mid);
  build(rch[k], mid + 1, r);
}
inline void pushup(int k) { sum[k] = sum[lch[k]] + sum[rch[k]]; }
inline void newnode(int old, int k) {
  sum[k] = sum[old];
  lch[k] = lch[old];
  rch[k] = rch[old];
}
void update(int old, int &k, int l, int r, int p, int x) {
  k = ++dfn;
  newnode(old, k);
  if (l == r) {
    sum[k] += x;
    return;
  }
  int mid = l + r >> 1;
  if (p <= mid) update(lch[old], lch[k], l, mid, p, x);
  if (mid + 1 <= p) update(rch[old], rch[k], mid + 1, r, p, x);
  pushup(k);
}
long long query(int k, int l, int r, int L, int R) {
  if (L <= l && R >= r) return sum[k];
  int mid = l + r >> 1;
  long long ret = 0;
  if (L <= mid) ret += query(lch[k], l, mid, L, R);
  if (mid + 1 <= R) ret += query(rch[k], mid + 1, r, L, R);
  return ret;
}
int main() {
  std::ios::sync_with_stdio(false);
  int n, m;
  scanf("%d%d", &n, &m);
  vector<int> X;
  for (int i = 0; i < n; i++)
    scanf("%d%d%d", &a[i].x, &a[i].r, &a[i].q), X.push_back(a[i].x);
  (sort(X.begin(), X.end())),
      X.resize(distance(X.begin(), unique(X.begin(), X.end())));
  int N = X.size();
  for (int i = 0; i < n; i++) {
    int pos = lower_bound(X.begin(), X.end(), a[i].x) - X.begin();
    Hashx[a[i].x] = pos;
  }
  sort(a, a + n);
  dfn = 0;
  int tot = 0;
  long long ans = 0;
  build(root[tot++], 0, N - 1);
  for (int i = 0; i < n; i++) {
    int base = max(0, a[i].q - m);
    int top = a[i].q + m;
    int l = lower_bound(X.begin(), X.end(), a[i].x - a[i].r) - X.begin();
    int r = upper_bound(X.begin(), X.end(), a[i].x + a[i].r) - X.begin() - 1;
    for (int j = base; j <= top; j++) {
      if (Hashq.find(j) == Hashq.end()) continue;
      ans += query(root[Hashq[j]], 0, N - 1, l, r);
    }
    int old = root[Hashq[a[i].q]];
    Hashq[a[i].q] = tot++;
    update(old, root[Hashq[a[i].q]], 0, N - 1, Hashx[a[i].x], 1);
  }
  printf("%lld\n", ans);
}