#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
} p[1200];
struct circie {
  int x, y, r;
} c[1200];
inline long long sqr(int x) {
  long long tmp = x;
  return tmp * tmp;
}
bool ins[1200][1200] = {0};
int main() {
  int i, j, k, m, n, q;
  scanf("%d%d%d", &m, &n, &q);
  for (i = 1; i <= m; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
  }
  for (i = 1; i <= n; i++) {
    scanf("%d%d%d", &c[i].r, &c[i].x, &c[i].y);
  }
  for (i = 1; i <= m; i++) {
    for (j = 1; j <= n; j++) {
      ins[i][j] = sqr(p[i].x - c[j].x) + sqr(p[i].y - c[j].y) < sqr(c[j].r);
    }
  }
  while (q--) {
    scanf("%d%d", &k, &j);
    int ans = 0;
    for (i = 1; i <= n; i++) {
      if (ins[k][i] != ins[j][i]) ++ans;
    }
    printf("%d\n", ans);
  }
  return 0;
}
