#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vec vector
#define PB push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define ull unsigned long long
#define pii pair<int,int>
#define rz resize
#define ld long double
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define matrix vec<vec<int>>
#define MP make_pair
const int N = 1e5+5;
const ll INF = 1e18;
const ll mod = 998244353;
mt19937_64 rng(time(0));
int random(int a, int b){ return uniform_int_distribution<ll>(a,b)(rng); }
int add(int a, int b) { a+=b;if(a>=mod)a-=mod; return a; }
struct Fen
{
vec<int>f;
int n;
void assign(int _n){
n=_n;f.rz(n+1);
}
void upd(int x, int v){ for(;x<=n;x+=x&-x)f[x]+=v; }
void upd(int l, int r, int x){ upd(l,x);upd(r+1,-x); }
int quer(int x){ int r=0;for(;x>0;x-=x&-x)r+=f[x];return r; }
};
int B,n,d,M;
namespace D2 {
void solve() {
vec<pii>a(n+1);
vec<int>st(n+1);
vec<int>vals;
for(int i=1;i<=n;++i)
cin>>a[i].F>>a[i].S,vals.PB(a[i].F-a[i].S),
vals.PB(a[i].F-a[i].S-d),vals.PB(a[i].F-a[i].S+d),st[i]=a[i].F+a[i].S;
sort(a.begin()+1,a.end(),[&](const pii& fi, const pii& se){
return (fi.F+fi.S == se.F+se.S ? fi.F-fi.S < se.F-se.S : fi.F+fi.S < se.F+se.S);
});
sort(all(vals));
sort(st.begin()+1,st.end());
auto getid=[&](int x)->int{
return lower_bound(all(vals),x)-vals.begin()+1;
};
Fen f;f.assign(3*n+2);
int an=0;
for(int i=1,j=1;i<=n;++i){
while(j < i && st[i]-st[j] > d){
int u=a[j].F-a[j].S;
int cl=getid(u-d),cr=getid(u+d);
f.upd(cl,cr,-1);++j;
}
int v=a[i].F-a[i].S;
int cl=getid(v-d),cr=getid(v+d);
an+=f.quer(getid(v));
f.upd(cl,cr,1);
}
cout<<an;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>B;
cin>>n;
cin>>d;
cin>>M;
if(B==1){
vec<int>a(n+1);
for(int i=1;i<=n;++i)cin>>a[i];
sort(a.begin()+1,a.end());
int j=1,an=0;
for(int i=1;i<=n;++i){
while(a[i]-a[j] > d)++j;
an += (i-j);
}
cout<<an<<'\n';
} else if(B==2){
D2::solve();
} else {
}
return 0;
}
