#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long kx[1005], ky[1005], r[1005], cx[1005], cy[1005], f[1005][1005],
    cnt[1005];
int main() {
  cin >> n >> m >> k;
  for (long long i = 0; i < n; i++) cin >> kx[i] >> ky[i];
  for (long long i = 0; i < m; i++) cin >> r[i] >> cx[i] >> cy[i];
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (sqrt((cx[j] - kx[i]) * (cx[j] - kx[i]) +
               (cy[j] - ky[i]) * (cy[j] - ky[i])) <= r[j]) {
        f[i][j] = 1;
        cnt[i]++;
      }
    }
  }
  for (long long i = 0; i < k; i++) {
    long long a, b;
    cin >> a >> b;
    a--;
    b--;
    long long sol = 0;
    for (long long j = 0; j < m; j++) sol += (f[a][j] && f[b][j]);
    cout << cnt[a] + cnt[b] - 2 * sol << endl;
  }
  return 0;
}
