#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}";
}
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")";
}
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

using db = long double;

using P = complex<db>;
  

using pp = pair<ll, ll>;

ll sgn(ll x) {
  if(!x)
    return 0;
  if(x < 0)
    return -1;
  return 1;
}


P cross(P a, P b) {
  return a.real() * b.imag() - a.imag() * b.real();
}

ll cross(pp a, pp b) {
  return a.first * b.second - a.second * b.first;
}

bool cmp(pp a, pp b) {
  auto half = [](pp p) {return sgn(p.second) ?: -sgn(p.first);};
  int A = half(a), B = half(b);
  return A == B ? cross(a, b) > 0 : A < B;
}

using db = long double;

int main() {

  cin.tie(0)->sync_with_stdio(0);

  int r, a, n;
  cin >> r >> a >> n;
  vector<db> di(r);
  vector<pair<ll, ll>> an(a);
  rep(i, 0, r) {
    cin >> di[i];
  }
  for(auto &[i, j] : an)
    cin >> i >> j;

  sort(all(di));
  sort(all(an), cmp);

  debug(an);
  debug(di);

  cout << setprecision(10) << fixed;
  
  
  auto perp = [&](P p ) {
    return P(-p.imag(), p.real());
  };

  auto onp = [&](P a, P b, P p, bool refl = false) {
    P v = b - a;
    return p - perp(v) * db(1 + refl) * cross(v, p - a) / pow(abs(v), 2);
  };

  rep(_, 0, n) {
    pp p;
    cin >> p.first >> p.second;
    // auto it0 = lower_bound(all(di), d);
    // int p0 = it0 - di.begin();

    auto it1 = lower_bound(all(an), p, cmp);
    int pos1 = it1 - an.begin();

    complex<db> moj(db(p.first), db(p.second));

    db mn = 1e18;

    debug(pos1);


    for(int d1 = -1; d1 <= 1; d1++) {
      int i = ((pos1 + d1) % a + a) % a;
      complex<db> p0(0.0, 0.0);
      complex<db> p1(an[i].first, an[i].second);
      
      P rzut = onp(p0, p1, moj);
      debug(p0, p1, moj, rzut);


      auto ins = [&] (int ite) {
        db ds = abs(di[ite]);
        auto tmp = p1;
        tmp /= abs(p1);
        tmp *= ds;
        mn = min(mn, abs(moj - tmp));
      };

      ins(0);
      ins(sz(di) - 1);

      int pos0 = lower_bound(all(di), abs(rzut)) - di.begin();
      for(int d0 = -2; d0 <= 2; d0++) {
        int j = ((pos0 + d0) % r + r) % r;
        ins(j);
      }

    }

    cout << mn << endl;
  }
}