#include <bits/stdc++.h>
using namespace std;
inline long long sq(long long n) { return n * n; }
inline bool inside(const pair<long long, long long> &p,
                   const pair<long long, pair<long long, long long> > &f) {
  long long d2 = sq(p.first - f.second.first) + sq(p.second - f.second.second);
  long long r2 = sq(f.first);
  return r2 < d2;
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<pair<long long, long long> > ps(n);
  for (int i = 0; i < n; i++) cin >> ps[i].first >> ps[i].second;
  vector<pair<long long, pair<long long, long long> > > fs(m);
  for (int i = 0; i < m; i++)
    cin >> fs[i].first >> fs[i].second.first >> fs[i].second.second;
  vector<vector<bool> > tbl(n, vector<bool>(m));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) tbl[i][j] = inside(ps[i], fs[j]);
  for (int i = 0; i < k; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    int ans = 0;
    for (int j = 0; j < m; j++) {
      if (tbl[a][j] != tbl[b][j]) ans++;
    }
    cout << ans << endl;
  }
  return 0;
}
