#include<bits/stdc++.h> using namespace std; struct aa { int x,r; }a[10005]; bool sort1(aa c,aa d) { return c.x<d.x; } double gou(double a,double c) { return sqrt(c*c-a*a); } int main() { int m; cin>>m; for(int i=1;i<=m;i++) { int n,w,h,ans=0; double s=0; cin>>n>>w>>h; for(int j=1;j<=n;j++) cin>>a[j].x>>a[j].r; sort(a+1,a+1+n,sort1); for(int j=1;j<=n;j++) { if(a[j].x-s<=gou(h*0.5,a[j].r)) { if(a[j+1].x-s<=gou(h*0.5,a[j+1].r)&&j!=n) continue; else { ans++; s=a[j].x+gou(h*0.5,a[j].r); } } else break; } if(s>=w) cout<<ans<<endl; else cout<<"0"<<endl; } return 0; }