#include <bits/stdc++.h>
using namespace std;
template <class T>
void pv(T a, T b) {
  for (T i = a; i != b; ++i) cout << *i << ' ';
  cout << endl;
}
complex<double> p[1024];
complex<double> q[1024];
int R[1024];
bool inside[1024][1024];
int main() {
  int N, M, K;
  while (~scanf("%d%d%d", &N, &M, &K)) {
    int x, y;
    for (int i = 0; i < (int)(N); ++i) {
      scanf("%d%d", &x, &y);
      p[i] = complex<double>(x, y);
    }
    for (int i = 0; i < (int)(M); ++i) {
      scanf("%d%d%d", &R[i], &x, &y);
      q[i] = complex<double>(x, y);
    }
    memset(inside, 0, sizeof(inside));
    for (int i = 0; i < (int)(N); ++i)
      for (int j = 0; j < (int)(M); ++j)
        if (abs(p[i] - q[j]) < R[j]) inside[i][j] = true;
    for (int k = 0; k < (int)(K); ++k) {
      int a, b;
      scanf("%d%d", &a, &b);
      a--, b--;
      int cnt = 0;
      for (int i = 0; i < (int)(M); ++i) cnt += inside[a][i] != inside[b][i];
      cout << cnt << endl;
    }
  }
  return 0;
}
