#include <bits/stdc++.h>
using namespace std;
long long n, m, k, r, cx, cy, i, j, a, b, x, y, v, w, count1, test;
pair<long long, long long> p[1000005], q[1000005];
long long arapos1[1000005], arapos2[1000005], aracheck[1005][1005];
long long pow(long long x) { return x * x; }
int main() {
  cin >> n >> m >> k;
  for (i = 1; i <= n; i++) {
    scanf("%I64d %I64d", &x, &y);
    p[i] = make_pair(x, y);
  }
  for (i = 1; i <= m; i++) {
    scanf("%I64d %I64d %I64d", &r, &cx, &cy);
    for (j = 1; j <= n; j++) {
      test = (cx - p[j].first) * (cx - p[j].first) +
             (cy - p[j].second) * (cy - p[j].second) - r * r;
      if (test < 0) {
        aracheck[j][i]++;
      }
    }
  }
  for (i = 1; i <= k; i++) {
    count1 = 0;
    scanf("%I64d %I64d", &a, &b);
    for (v = 1; v <= m; v++) {
      if (aracheck[a][v] != aracheck[b][v]) count1++;
    }
    printf("%I64d\n", count1);
  }
  return 0;
}
