#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#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()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	long double dist() const { return sqrt((long double)dist2()); }
	P unit() const { return *this/dist(); } // makes dist()=1
};
struct Angle {
	int x, y;
	int t;
        int type;
        int idx;
	Angle(int x=0, int y=0, int t=0) : x(x), y(y), t(t) {}
	Angle operator-(Angle b) const { return {x-b.x, y-b.y, t}; }
	int half() const {
		return y < 0 || (y == 0 && x < 0);
	}
	Angle t90() const { return {-y, x, t + (half() && x >= 0)}; }
	Angle t180() const { return {-x, -y, t + half()}; }
	Angle t360() const { return {x, y, t + 1}; }
};

long double eps=1e-11;
template<class F>
long double ternSearch(int a, int b, F f, Angle line, Angle point) {
        int iter = 0;
        /*
        int best = a;
    
        for(int i=a;i<=b;i++) if(f(line,point,i)<f(line,point,best)){
            printf("%.8Lf\n",f(line,point,i));
            best = i;
        }
        return f(line,point,best);
        */
        
	while (b - a >= 5) {
		int mid = (a + b) / 2;
                assert( abs(f(line,point,mid)-f(line,point,mid+1))>=eps );
		if (-f(line,point,mid) < -f(line,point,mid+1)) a = mid; // (A)
		else b = mid+1;
	}
	rep(i,a+1,b+1) if (-f(line,point,a) < -f(line,point,i)) a = i; // (B)
        return f(line,point,a);
}
typedef Point<long double> P;
int main()
{
    int r,f,n;
    scanf("%d%d%d",&r,&f,&n);
    vi dist(r);
    FOR(i,r)
        scanf("%d",&dist[i]);
    sort(dist.begin(),dist.end());
    vector<Angle> v(f+n);
    FOR(i,f){
        scanf("%d%d",&v[i].x,&v[i].y);
        v[i].type = 0;
        /*
        v[2*i+1].x = -v[2*i].y;
        v[2*i+1].y = -v[2*i].x;
        v[2*i+1].type = 0;
        */
    }
    FOR(i,n){
        scanf("%d%d",&v[i+f].x,&v[i+f].y);
        v[i+f].type = 1;
        v[i+f].idx = i;
    }
    auto F = [&](Angle& line, Angle& point,int i){
        P p1(line.x,line.y);
        p1 = p1.unit();
        p1=p1*dist[i];
        return (p1-P(point.x,point.y)).dist();
    };
    sort(v.begin(),v.end(),[](Angle a, Angle b){
    return make_tuple(a.t, a.half(), a.y * (ll)b.x) <
               make_tuple(b.t, b.half(), a.x * (ll)b.y);

    });
    int prev = -1, next = -1;
    vector<long double> ans(n,-1);
    FOR(i,f+n){
        if(v[i].type==0){
            prev = i;
        }
    }
    vector<Angle> q;
    FOR(i,f+n){
        if(v[i].type==1) q.push_back(v[i]); 
        else{
            if(next==-1) next = i;
            else{
                prev = next;
                next = i;
            }
            while(sz(q)){
                Angle ff = q.back();
                q.pop_back();
                //cout<<v[prev].x<<" "<<v[prev].y<<" "<<ff.x<<" "<<ff.y<<endl;
                //cout<<v[next].x<<" "<<v[next].y<<" "<<ff.x<<" "<<ff.y<<endl;
                long double a1 = ternSearch(0,r-1,F,v[prev],ff);
                long double a2 = ternSearch(0,r-1,F,v[next],ff);
                ans[ff.idx] = min(a1,a2);
            }
        }
    }
    int init = 0;
    FOR(i,f+n){
        if(v[i].type==0){
            init = i;
            break;
        }
    }
    while(sz(q)){
        Angle ff = q.back();
        q.pop_back();
        //cout<<v[prev].x<<" "<<v[prev].y<<" "<<ff.x<<" "<<ff.y<<endl;
        //cout<<v[next].x<<" "<<v[next].y<<" "<<ff.x<<" "<<ff.y<<endl;
        long double a1 = ternSearch(0,r-1,F,v[prev],ff);
        long double a2 = ternSearch(0,r-1,F,v[next],ff);
        long double a3 = ternSearch(0,r-1,F,v[init],ff);
        ans[ff.idx] = min(a1,a2);
        ans[ff.idx] = min(ans[ff.idx],a3);
    }
    FOR(i,n){
        printf("%.8Lf\n",ans[i]);
    }

    
    return 0;
}