#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef double ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
typedef complex<double> pt;
#define X real()
#define Y imag()
auto cross(pt u, pt v) {return (ll)u.X*v.Y-(ll)u.Y*v.X;}
auto sgn(ll a) {return a==0?0:(a>0?1:-1);}
auto ccw(pt p1, pt p2, pt p3) {auto u = p2-p1, v = p3-p2;return cross(u,v);}
auto in(pt p1, pt p2) {return (ll)p1.X*p2.X+(ll)p1.Y*p2.Y;}
// auto norm2(pt p) {return (ll)p.X*p.X+(ll)p.Y*p.Y;}
bool comp(const pt& a, const pt& b) { return a.X<b.X or (a.X==b.X and a.Y < b.Y);}
void read(pt& p) {
    int a,b; cin >> a >> b;
    p = {a,b};
}
bool lexo(pt a, pt b) {
    return a.X<b.X or (a.X==b.X and a.Y > b.Y);
}
pt o = {};
bool polarcomp(const pt& a, const pt& b) {
    bool lex1 = lexo(o,a), lex2 = lexo(o,b);
    if(lex1!=lex2) return lex1<lex2;
    return ccw(o,a,b)>0;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int R,f,n;
    cin >> R >> f >> n;
    vi r(R);
    for(auto& i : r) cin >> i;
    sort(all(r));
    vector<pair<pt,int>> pts;
    for(int i=0;i<f;++i) {
        pt p;
        read(p);
        pts.push_back({p,-1});
    }
    vector<double> d(n,INFINITY);
    for(int i=0;i<n;++i) {
        pt p;
        read(p);
        if(norm(p)==0) {
            d[i]=r[0];
        } else pts.push_back({p,i});
    }
    sort(all(pts),[&](auto i, auto j) {
        return polarcomp(i.first,j.first);
    });
    for(auto& [p,id] : pts) {
        if(id==-1) p/=abs(p);
    }
    
    for(int rep=0;rep<2;++rep) {
        {
            int i=0;
            while(pts[i].second!=-1) ++i;
            rotate(pts.begin(),i+all(pts));
        }
        
        auto updateAns = [&](pt p, int id, pt vec) {
            int lo=0,hi=R-1;
            auto mydist = [&](int i) {
                return norm(p-vec*double(r[i]));
            };
            while(lo<hi) {
                int mid = (lo+hi)/2;
                if(mydist(mid)>mydist(mid+1)) {
                    lo = mid+1;
                } else {
                    hi = mid;
                }
            }
            d[id] = min(d[id],sqrt(mydist(lo)));
        };
        const int M = 2;
        array<pt,M> last;
        for(int i=0;i<M;++i) {
            for(auto [p,id] : pts) {
                if(id==-1) {
                    copy(last.begin()+1,last.end(),last.begin());
                    last[M-1] = p/abs(p);
                }
            }
        }
        for(auto [p,id] : pts) {
            if(id==-1) {
                copy(last.begin()+1,last.end(),last.begin());
                last[M-1] = p;
            } else {
                for(auto& i : last) {
                    updateAns(p,id,i);
                }

            }
        }
        reverse(all(pts));
    }
    for(auto ans : d) {
        cout << setprecision(15) << ans << '\n';
    }


}