#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int kx[1001], ky[1001];
int r[1001], cx[1001], cy[1001];
long long patrat(long long x) { return x * x; }
int interior(int i, int j) {
  long long x = patrat(kx[i] - cx[j]);
  long long y = patrat(ky[i] - cy[j]);
  long long r2 = patrat(r[j]);
  if (x + y < r2) return 1;
  return 0;
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &kx[i], &ky[i]);
  for (int i = 1; i <= m; ++i) scanf("%d%d%d", &r[i], &cx[i], &cy[i]);
  for (int i = 1; i <= k; ++i) {
    int a, b;
    scanf("%d%d\n", &a, &b);
    int sol = 0;
    for (int j = 1; j <= m; ++j)
      if (interior(a, j) + interior(b, j) == 1) ++sol;
    printf("%d\n", sol);
  }
  return 0;
}
