#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
using ld = long double;
int r[N], R, F, n;
ld f[N];
ld check(ld cur_r, ld tag, int id, ld x, ld y) {
  int rp = lower_bound(r + 1, r + R + 1, (int)ceil(tag)) - r;
  ld res = 1e30;
  if(rp <= R) {
    ld _x = cosl(f[id]) * r[rp], _y = sinl(f[id]) * r[rp];
    res = min(res, std::sqrt((x - _x) * (x - _x) + (y - _y) * (y - _y)));
  }
  if(rp > 1) {
    ld _x = cosl(f[id]) * r[rp - 1], _y = sinl(f[id]) * r[rp - 1];
    res = min(res, std::sqrt((x - _x) * (x - _x) + (y - _y) * (y - _y)));
  }
  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] = atan2l(y, x);
  }
  sort(f + 1, f + F + 1);
  for(int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    ld cur_f = atan2l(y, x);
    int fp = lower_bound(f + 1, f + F + 1, cur_f) - f;
    if(fp > F) fp = 1;
    ld cur_r = sqrtl(1ll * x * x + 1ll * y * y);
    printf("%.15Lg\n", min({check(cur_r, cur_r * cos(cur_f - f[fp]), fp, x, y), 
                          check(cur_r, cur_r * cos(cur_f - f[fp == 1 ? F : fp - 1]), fp == 1 ? F : fp - 1, x, y),
                          check(cur_r, cur_r * cos(cur_f - f[fp == F ? 1 : fp + 1]), fp == F ? 1 : fp + 1, x, y)
                          }));
  }
  return 0;
}