#include <bits/stdc++.h>
using namespace std;
int x[3001], y[3001], r[3001], a[3001], b[3001];
bool can(int xx, int yy) {
  long long X = 1ll * (x[xx] - a[yy]) * (x[xx] - a[yy]) +
                1ll * (y[xx] - b[yy]) * (y[xx] - b[yy]);
  long long Y = 1ll * r[yy] * r[yy];
  if (Y >= X) return 1;
  return 0;
}
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", &x[i], &y[i]);
  for (int i = 1; i <= m; i++) scanf("%d %d %d", &r[i], &a[i], &b[i]);
  for (int i = 1; i <= k; i++) {
    int xx, yy;
    scanf("%d %d", &xx, &yy);
    int tot = 0;
    for (int j = 1; j <= m; j++) {
      if (can(xx, j) + can(yy, j) == 1) tot++;
    }
    cout << tot << endl;
  }
}
