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