#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;
}

using LDB = long double;
# define double LDB
const int MAXN = 100005;
struct Angle{
    int x, y;
    bool operator < (const Angle &t) const {
        // if(y == 0 && x < 0) return true;
        // if(y < 0 && t.y > 0) return true;
        return atan2(y,x) < atan2(t.y,t.x);
        // if(y >= 0 && t.y <= 0) return false;
        // return 1ll*x*t.y > 1ll*y*t.x;
    }
};
int radii[MAXN]; Angle 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(Angle ang, int x, int y, int cntr){
    double len = sqrt(1ll*ang.x*ang.x+1ll*ang.y*ang.y);
    double cox = ang.x/len, six = ang.y/len;
    double b = double(x)*cox+double(y)*six;
    double r = closer(cntr,b); // best
    // printf("angle = %.5f, r = %.5f\n",atan2(ang.y,ang.x),r);
    return (x-r*cox)*(x-r*cox)+(y-r*six)*(y-r*six);
}
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){
        angle[i].x = readint();
        angle[i].y = readint();
    }
    std::sort(angle+1,angle+cntp+1);
    // rep(i,1,cntp) printf("ang[%d] = %.5f\n",i,atan2(angle[i].y,angle[i].x));
    angle[0] = angle[cntp];
    angle[cntp+1] = angle[1];
    angle[cntp+2] = angle[2];
    while(n--){
        Angle arg; arg.x = readint(), arg.y = readint();
        if(arg.x == 0 && arg.y == 0){
            printf("%d\n",radii[1]);
            continue;
        }
        // printf("arg = %.5f\n",arg);
        int t = std::lower_bound(angle+1,angle+cntp+1,arg)-angle;
        double ouye = tryit(angle[t],arg.x,arg.y,cntr);
        ouye = std::min(ouye,tryit(angle[t-1],arg.x,arg.y,cntr));
        ouye = std::min(ouye,tryit(angle[t+1],arg.x,arg.y,cntr));
        if(t != 1)
            ouye = std::min(ouye,tryit(angle[t-2],arg.x,arg.y,cntr));
        else if(cntp != 1)
            ouye = std::min(ouye,tryit(angle[cntp-1],arg.x,arg.y,cntr));
        printf("%.13Lf\n",sqrt(ouye));
    }
	return 0;
}