#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define IMAX INT_MAX
#define IMIN INT_MIN
#define LMAX LLONG_MAX
#define LMIN LLONG_MIN
#define MOD 1000000007
#define SIR 1000000009
struct pt {
int x = 0, y = 0, z = 0;
pt() {};
pt(int _x) : x(_x) {};
pt(int _x, int _y) : x(_x), y(_y) {};
pt(int _x, int _y, int _z) : x(_x), y(_y), z(_z) {};
};
int dist(pt a, pt b) {
return abs(a.x - b.x) + abs(a.y - b.y) + abs(a.z - b.z);
}
int main() {
int t, n, d, m;
cin >> t >> n >> d >> m;
vector<pt> pts(n);
for (int i = 0; i < n; i++) {
int x = 0, y = 0, z = 0;
if (t == 1) cin >> x;
if (t == 2) cin >> x >> y;
if (t == 3) cin >> x >> y >> z;
pts[i] = pt(x, y, z);
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
res += (dist(pts[i], pts[j]) <= d);
}
}
cout << res << '\n';
return 0;
}
