#include <iostream>

 #include <cstdio>

 #include <cstdlib>

 #include <cstring>

 #include <algorithm>

 #include <cmath>

 inline void read(int &x){x = ;char ch = getchar();char c = ch;while(ch > '' || ch < '')c = ch, ch = getchar();while(ch <= '' && ch >= '')x = x *  + ch - '', ch = getchar();if(c == '-')x = -x;}

 const int MAXN =  + ;

 int g[MAXN][MAXN],by[MAXN],lk[MAXN];

 int r,a,t,ans;

 double x[MAXN],y[MAXN],v[MAXN],xx[MAXN],yy[MAXN]; 

 int find(int v)

 {

     for(int i = ;i <= a;i ++)

     {

         if(!by[i] && g[v][i])

         {

             by[i] = ;

             if((!lk[i]) || find(lk[i]))

             {

                 lk[i] = v;

                 return ;

             }

         }

     }

     return ;

 }

 int main()

 {

     read(r);read(a);read(t);

     for(int i = ;i <= a;i ++)

         scanf("%lf %lf", &x[i], &y[i]);

     for(int i = ;i <= r;i ++)

         scanf("%lf %lf %lf", &xx[i], &yy[i], &v[i]);

     for(int i = ;i <= a;i ++)

     {

         for(int j = ;j <= r;j ++)

         {

             g[j][i] = (sqrt((x[i] - xx[j]) * (x[i] - xx[j]) + (y[i] - yy[j]) * (y[i] - yy[j])) <= v[j] * t);

         }

     }

     for(int i = ;i <= r;i ++)

     {

         memset(by, , sizeof(by));

         if(find(i))ans ++;

     }

     printf("%d", ans);

     return ;

 }