func_code_string: #include <bits/stdc++.h>   using namespace std;   inline int read() {     int w = 1, s = 0;     char ch = getchar();     while (ch <  0  || ch >  9 ) {       if (ch ==  - ) w = 0;       ch = getchar();     }     while (ch >=  0  && ch <=  9 ) {       s = (s << 1) + (s << 3) + ch -  0 ;       ch = getchar();     }     return w ? s : -s;   }   const int N = 1001;   struct point {     int x, y, num;   } p[N];   struct square {     int x, y, r;   } s[N];   int opp[N], bel[N];   bool num[N];   int n, m, k, ans;   vector<int> f[N];   bool cmp1(point a, point b) { return a.x < b.x; }   bool cmp2(square a, square b) { return a.x - a.r < b.x - b.r; }   bool solve(int x) {     if (x == 0) return 1;     return 0;   }   void content() {     n = read(), m = read(), k = read();     for (int i = 1; i <= n; i++) p[i].x = read(), p[i].y = read(), p[i].num = i;     sort(p + 1, p + n + 1, cmp1);     for (int i = 1; i <= n; i++) opp[p[i].num] = i;     for (int i = 1; i <= m; i++) {       s[i].r = read();       s[i].x = read(), s[i].y = read();     }     sort(s + 1, s + m + 1, cmp2);     for (int i = 1; i <= m; i++) {       for (int j = 1; j <= n; j++) {         if (p[j].x < s[i].x - s[i].r) continue;         if (p[j].x > s[i].x + s[i].r) break;         int a = p[j].x, b = p[j].y, c = s[i].x, d = s[i].y;         double lc = sqrt(pow((a - c), 2) + pow((b - d), 2));         if (lc < s[i].r) f[p[j].num].push_back(i);       }     }     for (int i = 1; i <= k; i++) {       int x = read(), y = read();       for (int j = 0; j < f[x].size(); j++) num[f[x][j]] = solve(num[f[x][j]]);       for (int j = 0; j < f[y].size(); j++) num[f[y][j]] = solve(num[f[y][j]]);       for (int j = 1; j <= m; j++)         if (num[j]) ans++;       printf( %d n , ans);       ans = 0;       memset(num, 0, sizeof(num));     }   }   int main() {     content();     return 0;   }   