#include <bits/stdc++.h>
using namespace std;
int kx[1000], ky[1000], r[1000], cx[1000], cy[1000];
long long sq(long long first) { return first * first; }
bool is_inside(int i, int j) {
  return (sq(kx[i] - cx[j]) + sq(ky[i] - cy[j]) < sq(r[j]));
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) {
    scanf("%d %d", &kx[i], &ky[i]);
  }
  for (int i = 0; i < m; ++i) {
    scanf("%d %d %d", &r[i], &cx[i], &cy[i]);
  }
  for (int i = 0; i < k; ++i) {
    int a, b;
    scanf("%d %d\n", &a, &b);
    --a;
    --b;
    int ans = 0;
    for (int j = 0; j < m; ++j) {
      if (is_inside(a, j) + is_inside(b, j) == 1) ++ans;
    }
    printf("%d\n", ans);
  }
  return 0;
}
