#include <bits/stdc++.h>
const int N = 1005;
int n, m, k;
int x[N], y[N];
int in[N][N];
long long Dist2(long long x1, long long y1, long long x2, long long y2) {
  return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", &x[i], &y[i]);
  for (long long i = 1, r, p, q; i <= m; i++) {
    scanf("%lld %lld %lld", &r, &p, &q);
    for (int j = 1; j <= n; j++)
      if (Dist2(x[j], y[j], p, q) <= r * r) in[j][i] = true;
  }
  for (int i = 1, p, q; i <= k; i++) {
    int ans = 0;
    scanf("%d %d", &p, &q);
    for (int j = 1; j <= m; j++)
      if (in[p][j] ^ in[q][j] == 1) ans++;
    printf("%d\n", ans);
  }
  return 0;
}
