//ucup-b

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=5005,INF=1<<29;

//幾何ライブラリ
// define double ll をするときは Point の < と == も書き換えよう！

const double eps=1e-9;
const double pi=acos((double)-1.0L);
#define equals(a,b) (fabs((a)-(b))<eps)

double torad(double deg) {return (double)(deg)*pi/180.0;}
double todeg(double ang) {return ang*180.0/pi;}

class Point{
public:
    double x,y;
    
    Point(double x=0,double y=0):x(x),y(y){}
    
    Point operator + (Point p){return Point(x+p.x,y+p.y);}
    Point operator - (Point p){return Point(x-p.x,y-p.y);}
    Point operator * (double a){return Point(a*x,a*y);}
    Point operator / (double a){return Point(x/a,y/a);}
    
    double abs(){return sqrt(norm());}
    double norm(){return x*x+y*y;}
    
    bool operator < (const Point &p)const{
        return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);
        //return x<p.x||(x==p.x&&y<p.y);
    }
    
    bool operator == (const Point &p)const{
        return fabs(x-p.x)<eps/100000&&fabs(y-p.y)<eps/100000;
        //return x==p.x&&y==p.y;
    }
};

typedef Point Vector;

double norm(Vector a){
    return a.x*a.x+a.y*a.y;
}

double abs(Vector a){
    return sqrt(norm(a));
}

double dot(Vector a,Vector b){
    return a.x*b.x+a.y*b.y;
}

double cross(Vector a,Vector b){
    return a.x*b.y-a.y*b.x;
}

struct Segment{
    Point p1,p2;
};

//p0,p1,p2の順に見たときどうなるか？

static const int counter_clockwise=1;
static const int clockwise=-1;
static const int online_back=2;
static const int online_front=-2;
static const int on_segment=0;

int ccw(Point p0,Point p1,Point p2){
    Vector a=p1-p0;
    Vector b=p2-p0;
    
    if(cross(a,b)>eps) return counter_clockwise;
    if(cross(a,b)<-eps) return clockwise;
    if(dot(a,b)<-eps) return online_back;
    if(a.norm()<b.norm()) return online_front;
    
    return on_segment;
}

bool intersect(Point p1,Point p2,Point p3,Point p4){
    return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);
}

bool intersect(Segment s1,Segment s2){
    return intersect(s1.p1,s1.p2,s2.p1,s2.p2);
}

typedef Segment Line;

double getDistance(Point a,Point b){
    return abs(a-b);
}

double getDistanceLP(Line l,Point p){
    return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));
}

double getDistanceSP(Segment s,Point p){
    if(s.p1==s.p2) return getDistance(s.p1,p);
    if(dot(s.p2-s.p1,p-s.p1)<0.0) return abs(p-s.p1);
    if(dot(s.p1-s.p2,p-s.p2)<0.0) return abs(p-s.p2);
    return getDistanceLP(s,p);
}

double getDistance(Segment s1,Segment s2){
    if(intersect(s1,s2)) return 0.0;
    return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,r,d;cin>>N>>r>>d;
    
    ll ans=0;
    vector<vector<ll>> dat(N);
    for(int i=0;i<N;i++){
        int t;cin>>t;
        if(t==1){
            vector<ll> S(3);
            for(int i=0;i<3;i++) cin>>S[i];
            dat[i]=S;
            ans--;
        }else{
            vector<ll> S(6);
            for(int i=0;i<6;i++) cin>>S[i];
            dat[i]=S;
            ans-=2;
        }
    }
    
    auto mkp=[&](ll a,ll b){
        return Point{(double)(a),(double)(b)};
    };
    
    auto check=[&](ll L1,ll R1,Point a,ll L2,ll R2,Point s1,Point s2,bool kotei){
        ll L=max(L1,L2);
        ll R=min(R1,R2);
        if(L>R) return false;
        if(kotei){
            if(getDistanceSP({s1,s2},a)<=r+r+eps) return true;
            else return false;
        }else{
            Point t1=s1+(s2-s1)/(R2-L2)*(L-L2);
            Point t2=s1+(s2-s1)/(R2-L2)*(R-L2);
            if(getDistanceSP({t1,t2},a)<=r+r+eps) return true;
            else return false;
        }
    };
    // [L1,R1]にaが出現して、[L2,R2]で (kotei==trueならば線分(s1,s2)) (kotei==falseならばL2にs1にいてR2にs2にいるような動く点) が出現する時に、距離2r以下になるか？
    
    auto solve=[&](int ii,int jj){
        auto A=dat[ii],B=dat[jj];
        if(si(A)==3){
            if(si(B)==3){
                bool f=false;
                if(check(A[2]-d,A[2]+d,mkp(A[0],A[1]),B[2]-d,B[2]+d,mkp(B[0],B[1]),mkp(B[0],B[1]),true)) f=true;
                if(f) ans++;
            }else{
                {
                    bool f=false;
                    if(check(A[2]-d,A[2]+d,mkp(A[0],A[1]),B[4]-d,B[4],mkp(B[0],B[1]),mkp(B[0],B[1]),true)) f=true;
                    if(check(A[2]-d,A[2]+d,mkp(A[0],A[1]),B[4],B[5],mkp(B[0],B[1]),mkp(B[2],B[3]),false)) f=true;
                    if(check(A[2]-d,A[2]+d,mkp(A[0],A[1]),B[5],B[5]+d,mkp(B[2],B[3]),mkp(B[2],B[3]),true)) f=true;
                    
                    if(f) ans++;
                }
                
                {
                    bool f=false;
                    if(check(A[2]-d,A[2]+d,mkp(A[0],A[1]),B[4]-d,B[5]+d,mkp(B[0],B[1]),mkp(B[2],B[3]),true)) f=true;
                    if(f) ans++;
                }
            }
        }else{
            {
                bool f=false;
                if(check(A[4]-d,A[4],mkp(A[0],A[1]),B[4]-d,B[4],mkp(B[0],B[1]),mkp(B[0],B[1]),true)) f=true;
                if(check(A[4]-d,A[4],mkp(A[0],A[1]),B[4],B[5],mkp(B[0],B[1]),mkp(B[2],B[3]),false)) f=true;
                if(check(A[4]-d,A[4],mkp(A[0],A[1]),B[5],B[5]+d,mkp(B[2],B[3]),mkp(B[2],B[3]),true)) f=true;
                
                if(check(B[4]-d,B[4],mkp(B[0],B[1]),A[4],A[5],mkp(A[0],A[1]),mkp(A[2],A[3]),false)) f=true;
                
                if(check(B[5],B[5]+d,mkp(B[2],B[3]),A[4],A[5],mkp(A[0],A[1]),mkp(A[2],A[3]),false)) f=true;
                
                if(check(A[5],A[5]+d,mkp(A[2],A[3]),B[4]-d,B[4],mkp(B[0],B[1]),mkp(B[0],B[1]),true)) f=true;
                if(check(A[5],A[5]+d,mkp(A[2],A[3]),B[4],B[5],mkp(B[0],B[1]),mkp(B[2],B[3]),false)) f=true;
                if(check(A[5],A[5]+d,mkp(A[2],A[3]),B[5],B[5]+d,mkp(B[2],B[3]),mkp(B[2],B[3]),true)) f=true;
                
                if(!f){
                    if(max(A[4],B[4])<=min(A[5],B[5])){
                        double L=max(A[4],B[4]),R=min(A[5],B[5]);
                        Vector v1=(mkp(A[2],A[3])-mkp(A[0],A[1]))/(A[5]-A[4]);
                        Vector v2=(mkp(B[2],B[3])-mkp(B[0],B[1]))/(B[5]-B[4]);
                        
                        Point s1=mkp(A[0],A[1])+v1*(L-A[4]);
                        Point t1=mkp(B[0],B[1])+v2*(L-B[4]);
                        
                        Point p=t1-s1,vp=v2-v1;
                        if(getDistanceSP({p,p+vp*(R-L)},{0.0,0.0})<=r+r+eps) f=true;
                    }
                }
                
                if(f) ans++;
            }
            
            for(int q=0;q<2;q++){
                {
                    bool f=false;
                    if(check(A[4]-d,A[4],mkp(A[0],A[1]),B[4]-d,B[5]+d,mkp(B[0],B[1]),mkp(B[2],B[3]),true)) f=true;
                    if(max(A[4],B[4]-d)<=min(A[5],B[5]+d)){
                        ll L=max(A[4],B[4]-d),R=min(A[5],B[5]+d);
                        ll L2=A[4],R2=A[5];
                        Point s1=mkp(A[0],A[1]),s2=mkp(A[2],A[3]),t1=mkp(B[0],B[1]),t2=mkp(B[2],B[3]);
                        Point x1=s1+(s2-s1)/(R2-L2)*(L-L2);
                        Point x2=s1+(s2-s1)/(R2-L2)*(R-L2);
                        double mi=1e18;
                        chmin(mi,getDistanceSP({x1,x2},t1));
                        chmin(mi,getDistanceSP({x1,x2},t2));
                        chmin(mi,getDistanceSP({t1,t2},x1));
                        chmin(mi,getDistanceSP({t1,t2},x2));
                        if(intersect({x1,x2},{t1,t2})) mi=0;
                        
                        if(mi<=r+r+eps) f=true;
                    }
                    if(check(A[5],A[5]+d,mkp(A[2],A[3]),B[4]-d,B[5]+d,mkp(B[0],B[1]),mkp(B[2],B[3]),true)) f=true;
                    
                    if(f) ans++;
                }
                
                swap(A,B);
            }
            
            {
                bool f=false;
                if(max(A[4]-d,B[4]-d)<=min(A[5]+d,B[5]+d)){
                    Point s1=mkp(A[0],A[1]),s2=mkp(A[2],A[3]),t1=mkp(B[0],B[1]),t2=mkp(B[2],B[3]);
                    double mi=1e18;
                    chmin(mi,getDistanceSP({s1,s2},t1));
                    chmin(mi,getDistanceSP({s1,s2},t2));
                    chmin(mi,getDistanceSP({t1,t2},s1));
                    chmin(mi,getDistanceSP({t1,t2},s2));
                    if(intersect({s1,s2},{t1,t2})) mi=0;
                    
                    if(mi<=r+r+eps) f=true;
                }
                
                if(f) ans++;
            }
        }
    };
    
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(si(dat[i])>si(dat[j])){
                solve(j,i);
            }else{
                solve(i,j);
            }
        }
    }
    
    ans/=2;
    
    cout<<ans<<endl;
    
}