#include <bits/stdc++.h>
typedef struct circle {
  long long int x;
  long long int y;
  long long int r;
};
circle C[1005];
long long int save[1005][1005];
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  pair<long long int, long long int> K[n + 1];
  for (int i = 1; i <= n; ++i) scanf("%lld %lld", &K[i].first, &K[i].second);
  for (int i = 1; i <= m; ++i)
    scanf("%lld %lld %lld ", &C[i].r, &C[i].x, &C[i].y);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      save[i][j] = (K[i].first - C[j].x) * (K[i].first - C[j].x);
      save[i][j] = save[i][j] + (K[i].second - C[j].y) * (K[i].second - C[j].y);
      save[i][j] = save[i][j] - C[j].r * C[j].r;
    }
  }
  while (k--) {
    int ai, bi;
    scanf("%d %d", &ai, &bi);
    int ans = 0;
    for (int i = 1; i <= m; ++i) {
      if (save[ai][i] < 0 && save[bi][i] > 0)
        ++ans;
      else if (save[ai][i] > 0 && save[bi][i] < 0)
        ++ans;
    }
    printf("%d\n", ans);
  }
  return 0;
}
