#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<pair<int, int>> points(n);
  for (int i = 0; i < n; i++) {
    cin >> points[i].first >> points[i].second;
  }
  vector<bitset<1000>> contains(n);
  for (int i = 0; i < m; i++) {
    int r, x, y;
    cin >> r >> x >> y;
    for (int j = 0; j < n; j++) {
      ll dist = 1ll * (x - points[j].first) * (x - points[j].first) +
                1ll * (y - points[j].second) * (y - points[j].second);
      if (dist <= 1ll * r * r) {
        contains[j][i] = 1;
      }
    }
  }
  vector<vector<int>> ans(n, vector<int>(n, 0));
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      ans[i][j] = (contains[i] ^ contains[j]).count();
      ans[j][i] = ans[i][j];
    }
  }
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    cout << ans[x][y] << "\n";
  }
  return 0;
}
