#include <bits/stdc++.h>
using namespace std;
bitset<1005> dp[1005];
vector<long long> x(1005), y(1005);
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i += 1) {
    cin >> x[i] >> y[i];
  }
  long long r, a, b;
  for (int i = 1; i <= m; i += 1) {
    cin >> r >> a >> b;
    for (int j = 1; j <= n; j += 1) {
      if ((x[j] - a) * (x[j] - a) + (y[j] - b) * (y[j] - b) < r * r) {
        dp[j][i] = 1;
      }
    }
  }
  while (k--) {
    cin >> a >> b;
    bitset<1005> temp = dp[a] ^ dp[b];
    cout << (temp).count() << "\n";
  }
}
