#include <bits/stdc++.h>
using namespace std;
int in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
const int maxn = 1e6 + 10;
const int inf = 1e9 + 10;
int x[maxn], y[maxn], R[maxn], X[maxn], Y[maxn];
inline long long dis(int x, int y, int x2, int y2) {
  return 1LL * (x - x2) * (x - x2) + 1LL * (y - y2) * (y - y2);
}
inline bool inside(int x, int y, int x2, int y2, int R) {
  return dis(x, y, x2, y2) < 1LL * R * R;
}
int32_t main() {
  int n = in(), m = in(), k = in();
  for (int i = 0; i < n; i++) x[i] = in(), y[i] = in();
  for (int i = 0; i < m; i++) R[i] = in(), X[i] = in(), Y[i] = in();
  for (int i = 0; i < k; i++) {
    int a = in() - 1, b = in() - 1;
    int res = 0;
    for (int j = 0; j < m; j++)
      res += (inside(x[a], y[a], X[j], Y[j], R[j]) +
              inside(x[b], y[b], X[j], Y[j], R[j])) == 1;
    printf("%d\n", res);
  }
}
