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>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
using namespace std;
const int maxn = 1e5 + 10;
struct robot {
  int x, r, iq;
  robot() {}
  robot(int a, int b, int c) : x(a), r(b), iq(c) {}
  bool operator<(const robot rhs) const { return r > rhs.r; }
} R[maxn];
struct dynamictree {
  struct node {
    int l, r, val;
    struct node *left, *right;
    node(int a, int b, int c) : l(a), r(b), val(c), left(NULL), right(NULL) {}
  };
  node *tree[maxn];
  node *add(node *rt, int pos, int l, int r, int val) {
    if (l > r || pos < l || pos > r) return rt;
    if (rt == NULL) {
      rt = new node(l, r, 0);
    }
    if (l == r && pos == r) {
      rt->val += val;
      return rt;
    }
    int mid = (l + r) >> 1;
    if (pos <= mid) {
      rt->left = add(rt->left, pos, l, mid, val);
    } else {
      rt->right = add(rt->right, pos, mid + 1, r, val);
    }
    int v1 = rt->left == NULL ? 0 : rt->left->val;
    int v2 = rt->right == NULL ? 0 : rt->right->val;
    rt->val = v1 + v2;
    return rt;
  }
  int ask(node *rt, int l, int r) {
    if (rt == NULL) return 0;
    if (l <= rt->l && rt->r <= r) return rt->val;
    int mid = (rt->l + rt->r) >> 1;
    if (r <= mid) {
      return ask(rt->left, l, r);
    }
    if (l > mid) {
      return ask(rt->right, l, r);
    }
    return ask(rt->left, l, r) + ask(rt->right, l, r);
  }
  void update(int pos, int val, int version) {
    tree[version] = add(tree[version], pos, 0, 1000000000, val);
  }
  int query(int l, int r, int version) { return ask(tree[version], l, r); }
} tree;
int N, K, tot;
unordered_map<int, int> mp;
int main() {
  scanf("%d %d", &N, &K);
  vector<int> tmp;
  for (int i = 1; i <= N; ++i) {
    scanf("%d %d %d", &R[i].x, &R[i].r, &R[i].iq);
    tmp.push_back(R[i].iq);
  }
  sort(R + 1, R + 1 + N);
  sort(tmp.begin(), tmp.end());
  tot = 1;
  for (int i : tmp) {
    if (!mp[i]) {
      mp[i] = tot;
      ++tot;
    }
  }
  long long ret = 0;
  for (int i = 1; i <= N; ++i) {
    int q = R[i].iq;
    for (int k = -K; k <= K; ++k) {
      if (mp[q + k]) {
        ret += tree.query(max(R[i].x - R[i].r, 0),
                          min(R[i].x + R[i].r, 1000000000), mp[q + k]);
      }
    }
    tree.update(R[i].x, 1, mp[q]);
  }
  printf("%lld\n", ret);
}