#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
using bt = bitset<2000>;
bt c[2000];
void solve() {
  int n, m, r;
  cin >> n >> m >> r;
  vector<int> x(n), y(n);
  vector<long long> b(n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i] >> b[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int ma = max(abs(x[i] - x[j]), abs(y[i] - y[j]));
      if (ma > r) c[i][j] = 1;
    }
  }
  modint al = comb(n, m);
  modint ans = 0;
  for (int i = 0; i < n; i++) {
    modint cnt = c[i].count();
    cnt = al - comb(cnt, m);
    modint val = b[i] * b[i];
    ans += cnt * val;
  }
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      modint cnt = 0;
      int z = c[i].count();
      cnt += al - comb(z, m);
      z = c[j].count();
      cnt += al - comb(z, m);
      z = (c[i] & c[j]).count();
      cnt -= al - comb(z, m);
      modint val = 2 * b[i] * b[j];
      ans += cnt * val;
    }
  cout << ans << "\n";
}
signed main() {
  init_f();
  solve();
  return 0;
}
