#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
typedef double db; 
const int N = 2e5 + 5; 
const db PI = acos(-1.0); 
int R, F, n, x, y; 
db ans, r[N], ang[N]; 

db dist (db x_1, db y_1, db x_2, db y_2) {
  return sqrt((x_1 - x_2) * (x_1 - x_2) + (y_1 - y_2) * (y_1 - y_2)); 
}
db gan (db x, db y) {
  if(x == 0) return (y > 0 ? PI / 2 : PI * 3 / 2); 
  else if(x >= 0 && y >= 0) return atan(y / x); 
  else if(x < 0 && y >= 0) return PI - atan(y / (-x)); 
  return gan(-x, -y) + PI; 
}
void chk (db r, db ang) {
  db nx = r * cos(ang), ny = r * sin(ang); 
  // printf("%.10f %.10f %.10f %.10f %.10f\n", x, y, nx, ny, ang); 
  ans = min(ans, dist(x, y, nx, ny)); 
}
void chk (db ang) {
  db dx = cos(ang), dy = sin(ang); 
  db rr = 1.0 * x * dx + 1.0 * y * dy; 
  int l1 = upper_bound(r + 1, r + R + 1, rr) - r - 1; 
  int r1 = lower_bound(r + 1, r + R + 1, rr) - r; 
  if(l1) chk(r[l1], ang); 
  if(r1 <= R) chk(r[r1], ang); 
}

int main () {
  scanf("%d%d%d", &R, &F, &n); 
  rep(i, 1, R) scanf("%lf", &r[i]); 
  sort(r + 1, r + R + 1); 
  rep(i, 1, F) {
    scanf("%d%d", &x, &y); 
    ang[i] = gan(x, y), ang[i + F] = ang[i] + 2.0 * PI; 
    // printf("%d %d %.10lf\n", x, y, ang[i]); 
  }
  F *= 2; 
  sort(ang + 1, ang + F + 1); 
  rep(i, 1, n) {
    scanf("%d%d", &x, &y); 
    ans = 1e16; 
    db A = gan(x, y);
    int l = upper_bound(ang + 1, ang + F + 1, A) - ang - 1; 
    int r = lower_bound(ang + 1, ang + F + 1, A) - ang; 
    if(l && l <= F) chk(ang[l]); 
    if(r && r <= F) chk(ang[r]);  
    A += PI * 2;
    l = upper_bound(ang + 1, ang + F + 1, A) - ang - 1; 
    r = lower_bound(ang + 1, ang + F + 1, A) - ang; 
    if(l && l <= F) chk(ang[l]); 
    if(r && r <= F) chk(ang[r]);  
    printf("%.12lf\n", ans); 
  }
  return 0; 
}