#include <bits/stdc++.h>
using namespace std;
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  unsigned long long c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  while (cin >> n) {
    int m, k;
    cin >> m >> k;
    pair<long long, long long> arr[n];
    for (int i = 0; i < (n); i++) cin >> arr[i].first >> arr[i].second;
    pair<pair<long long, long long>, int> reg[m];
    for (int i = 0; i < (m); i++)
      cin >> reg[i].second >> reg[i].first.first >> reg[i].first.second;
    bitset<1010> bbb[n], hhh;
    for (int i = 0; i < (m); i++) {
      for (int j = 0; j < (n); j++) {
        if (sqrt((reg[i].first.first - arr[j].first) *
                     (reg[i].first.first - arr[j].first) +
                 (reg[i].first.second - arr[j].second) *
                     (reg[i].first.second - arr[j].second)) <= reg[i].second) {
          bbb[j].set(i);
        }
      }
    }
    int x, y;
    for (int i = 0; i < (k); i++) {
      cin >> x >> y;
      x--;
      y--;
      hhh = bbb[x];
      hhh &= bbb[y];
      cout << ((bbb[x] | bbb[y]).count() - hhh.count()) << "\n";
    }
  }
  return 0;
}
