#include <bits/stdc++.h>
using namespace std;
pair<int, int> kp[1005];
bitset<1000> cir[1005];
bool isin(pair<int, int> kp, int r, int x, int y) {
  return (double)(kp.first - x) * (kp.first - x) +
             (double)(kp.second - y) * (kp.second - y) <
         (double)r * r;
}
int main() {
  int n, m, k;
  int r, x, y;
  while (scanf("%d%d%d", &n, &m, &k) != EOF) {
    memset(cir, 0, sizeof(cir));
    for (int i = 0; i < n; i++) {
      scanf("%d%d", &kp[i].first, &kp[i].second);
    }
    for (int i = 0; i < m; i++) {
      scanf("%d%d%d", &r, &x, &y);
      for (int j = 0; j < n; j++) {
        if (isin(kp[j], r, x, y)) {
          cir[j][i] = 1;
        }
      }
    }
    for (int i = 0; i < k; i++) {
      scanf("%d%d", &x, &y);
      printf("%d\n", (cir[x - 1] ^ cir[y - 1]).count());
    }
  }
  return 0;
}
