#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<bitset>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
#define ENDL putchar('\n')
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
# define rep0(i,a,b) for(int i=(a); i!=(b); ++i)
inline LL readint() {
	LL f=1,x=0;int s=getchar();
	while(s<'0'||s>'9') {if(s<0)return -1;if(s=='-')f=-f;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^48);s=getchar();}
	return f*x;
}

const int MAXN = 100005;
int radii[MAXN]; double angle[MAXN];

int closer(int cntr, double x){
    int t = std::lower_bound(radii+1,radii+cntr+1,x)-radii;
    if(t == cntr+1) return radii[cntr];
    if(t == 1) return radii[1];
    if(radii[t]-x < x-radii[t-1])
        return radii[t];
    return radii[t-1]; // closer
}
double tryit(double ang, int x, int y, int cntr){
    double b = x*cos(ang)+y*sin(ang);
    double r = closer(cntr,b); // best
    // printf("angle = %.5f, r = %.5f\n",ang,r);
    return double(x)*x+double(y)*y+r*r-2*r*b;
}
int main(){
    int cntr = readint(), cntp = readint(), n = readint();
    rep(i,1,cntr) radii[i] = readint();
    std::sort(radii+1,radii+cntr+1);
    rep(i,1,cntp){
        int x = readint(), y = readint();
        angle[i] = atan2(y,x);
    }
    std::sort(angle+1,angle+cntp+1);
    angle[0] = angle[cntp];
    angle[cntp+1] = angle[1];
    while(n--){
        int x = readint(), y = readint();
        double arg = atan2(y,x);
        // printf("arg = %.5f\n",arg);
        int t = std::lower_bound(angle+1,angle+cntp+1,arg)-angle;
        printf("%.13f\n",sqrt(std::min(
            tryit(angle[t],x,y,cntr),
            tryit(angle[t-1],x,y,cntr))));
    }
	return 0;
}