#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T Abs(T a) {
  if (a < 0) return -a;
  return a;
}
template <class T>
inline T squ(T a) {
  return a * a;
}
template <class T>
inline T cub(T a) {
  return a * a * a;
}
struct point {
  long long x, y;
};
long long N, M, K, rad[1010];
point circle[1010], cpoint[1010];
short mat[1010][1010];
int main() {
  cin >> N >> M >> K;
  for (int i = 1; i <= N; i++) {
    cin >> cpoint[i].x >> cpoint[i].y;
  }
  for (int i = 1; i <= M; i++) {
    cin >> rad[i] >> circle[i].x >> circle[i].y;
    for (int j = 1; j <= N; j++) {
      if (squ(circle[i].x - cpoint[j].x) + squ(circle[i].y - cpoint[j].y) <
          squ(rad[i])) {
        mat[i][j] = 1;
      }
    }
  }
  for (int i = 1; i <= K; i++) {
    int first, second, sol = 0;
    cin >> first >> second;
    for (int j = 1; j <= M; j++) {
      if (mat[j][first] ^ mat[j][second] == 1) {
        sol++;
      }
    }
    cout << sol << '\n';
  }
  return 0;
}
