#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
struct circle {
  double r, x, y;
} c[1005];
pair<double, double> pp[1005];
double z1;
bitset<1005> bb[1005];
double dis(int i, int xx) {
  double z = (c[i].x - pp[xx].first) * (c[i].x - pp[xx].first) +
             (c[i].y - pp[xx].second) * (c[i].y - pp[xx].second);
  z = sqrt(z);
  return z;
}
signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> pp[i].first >> pp[i].second;
  for (int i = 1; i <= m; i++) {
    cin >> c[i].r >> c[i].x >> c[i].y;
    for (int j = 1; j <= n; j++)
      if (dis(i, j) < c[i].r) bb[j][i] = 1;
  }
  while (k--) {
    int a, b, ans = 0;
    cin >> a >> b;
    ans = (bb[a] ^ bb[b]).count();
    cout << ans << endl;
  }
  return 0;
}
