#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int r[N], R, F, n;
double f[N];
double check(double cur_r, double tag) {
  int rp = lower_bound(r + 1, r + R + 1, (int)ceil(tag)) - r;
  double res = 1e30;
  if(rp <= R) {
    res = min(res, cur_r * cur_r + (double)r[rp] * r[rp] - 2 * tag * r[rp]);
  }
  if(rp > 1) {
    res = min(res, cur_r * cur_r + (double)r[rp - 1] * r[rp - 1] - 2 * tag * r[rp - 1]);
  }
  return res;
}
int main() {
  scanf("%d %d %d", &R, &F, &n);
  for(int i = 1; i <= R; i++) {
    scanf("%d", &r[i]);   
  }
  sort(r + 1, r + R + 1);
  for(int i = 1; i <= F; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    f[i] = atan2(y, x);
  }
  sort(f + 1, f + F + 1);
  for(int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    double cur_f = atan2(y, x);
    int fp = lower_bound(f + 1, f + F + 1, cur_f) - f;
    if(fp > F) fp = 1;
    double cur_r = sqrt(1ll * x * x + 1ll * y * y);
    printf("%.15lg\n", sqrt(min(check(cur_r, cur_r * cos(cur_f - f[fp])), 
                          check(cur_r, cur_r * cos(cur_f - f[fp == 1 ? F : fp - 1])))));
  }
  return 0;
}