#include <bits/stdc++.h>
#define int long long
#define lson k<<1
#define rson (k<<1)|1
#define debug cout<<666<<endl;
using namespace std;
#define eps 1e-8
#define pai 3.1415926535897932384
const int N=1e6+5;
struct Point
{
    double x, y;
    Point(double x = 0, double y = 0) : x(x), y(y) {}
};
typedef Point Vector;
/********** 向量 + 向量 = 向量 **********/
Vector operator+(Vector a, Vector b)
{
    return Vector(a.x + b.x, a.y + b.y);
}
/********** 点 - 点 = 向量 **********/
Vector operator-(Point a, Point b)
{
    return Vector(a.x - b.x, a.y - b.y);
}
/********** 向量 * 数 = 向量 **********/
Vector operator*(Vector a, double b)
{
    return Vector(a.x * b, a.y * b);
}
/********** 向量 / 数 = 向量 **********/
Vector operator/(Vector a, double b)
{
    return Vector(a.x / b, a.y / b);
}
bool operator<(const Point &a, const Point &b)
{
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}
int dcmp(double x) // 减少精度问题
{
    if (fabs(x) < eps)
        return 0;
    else
        return x < 0 ? -1 : 1;
}
bool operator==(const Point &a, const Point &b) // 判断两点是否相等
{
    return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
/********** 向量点积 **********/
double Dot(Vector a, Vector b)
{
    return a.x * b.x + a.y * b.y;
}
/********** 向量长度 **********/
double Length(Vector A)
{
    return sqrt(Dot(A, A));
}
/********** 两向量角度 *********/
double Angle(Vector A, Vector B)
{
    return acos(Dot(A, B) / Length(A) / Length(B));
}
/********** 2向量求叉积 **********/
double Cross(Vector a, Vector b)
{
    return a.x * b.y - b.x * a.y;
}
/********** 点在直线上的投影 ***********/
Point GetLineProjection(Point P,Point A,Point B)
{
    Vector v = B-A;
    return A+v*(Dot(v,P-A) / Dot(v,v));
}
double PointtoPont(Point x,Point y){
    double tmp=sqrt((x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y));
    return tmp;
}
/********** 3点求叉积 **********/
double Cross(Point a, Point b, Point c)
{
    return (c.x - a.x) * (b.y - a.y) - (c.y - a.y) * (b.x - a.x);
}
Vector bc={0,1};
struct vis
{
    double x, y;
    double jiao;
};
vis a[N];
Point aa[N];
Point O={0,0};
double r[N];
int R,n,k;
int cmp(vis x,vis y){
    return x.jiao<y.jiao;
}
Point getPoint(int x,double w){
    Point tmp;
    
    tmp.x=w*sin(a[x].jiao);
    tmp.y=w*cos(a[x].jiao);
    return tmp;
}
double getans(int xa,Point z){
    Point hh;
    hh.x=a[xa].x;
    hh.y=a[xa].y;
    Point tmp=GetLineProjection(z,O,hh);
    double len=Length(tmp);
    // if(Angle(hh,bc)!=Angle(tmp,bc))len=0;
    // cout<<len<<"\n";
    int ll=1,rr=R;
    while(ll<=rr){
        int mid=(ll+rr)/2;
        if(r[mid]>len)rr=mid-1;
        else ll=mid+1;
    }
    int now=ll;
    if(now>R)now--;
    double ans=PointtoPont(getPoint(xa,r[now]),z);
    now--;
    if(now>0){
        ans=min(ans,PointtoPont(getPoint(xa,r[now]),z));
    }
    ans=min(ans,PointtoPont(getPoint(xa,r[1]),z));
    return ans;
}
void vision()
{
    // cout<<GetLineProjection({8,1},O,{0,-1}).x<<" "<<GetLineProjection({8,1},O,{0,-1}).y<<"\n";
    
    cin>>R>>n>>k;
    for(int i=1;i<=R;i++){
        cin>>r[i];
    }
    sort(r+1,r+1+R);
    for(int i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
        aa[i].x=a[i].x;aa[i].y=a[i].y;
        a[i].jiao=Angle(aa[i],bc);
        if(aa[i].x<0)a[i].jiao=pai*2-a[i].jiao;
    }
    sort(a+1,a+1+n,cmp);
    // for(int i=1;i<=n;i++){
    //     cout<<a[i].jiao<<"\n";
    // }
    while(k--){
        Point tmp;
        cin>>tmp.x>>tmp.y;
        double tjiao=Angle(tmp,bc);
        if(tmp.x<0)tjiao=pai*2-tjiao;
        // cout<<tjiao<<" ";
        int l1=1,r1=n;
        while(l1<=r1){
            int mid=(l1+r1)/2;
            if(a[mid].jiao>tjiao)r1=mid-1;
            else l1=mid+1;
        }
        int nowa=l1;
        double ans=1e18;
        if(nowa>n)nowa=1;
        ans=min(ans,getans(nowa,tmp));
        nowa--;
        if(nowa<=0)nowa=n;
        // cout<<nowa<<"\n";
        ans=min(ans,getans(nowa,tmp));
        cout<<fixed<<setprecision(12)<<ans<<"\n";
        // cout<<ans<<"\n";
    }
    return ;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
    // cin>>t;
    while(t--){
        vision();
    }
    return 0;
}