#include <bits/stdc++.h>
#define ll long long
#define double long double
using namespace std;
const int mod = 1e9 + 7;
const int M = 1e6 + 7;
ll n, m;
double pi = acos(-1);
double a[M],r[M],x[M],y[M];
double angle (double x,double y)
{
    if (x == 0)
    {
        if (y > 0)
        {
            return pi / 2.0;
        }
        else
        {
            return -pi / 2.0;
        }
    }

    if (x > 0)
    {
        return atan(y / x);
    }
    else if (y < 0)
    {
        return -pi + atan(y / x);
    }
    else
    {
        return pi + atan(y / x);
    }
}

double dis (double x,double y)
{
    return sqrt(x * x + y * y);
}
double get_dis(double Angle,double r,double x,double y)// 点到直线
{
    double dx = r * cos(Angle),dy = r * sin(Angle);

    return dis(dx - x,dy - y);
}
void Z()
{
    int R,F,N;
    cin >> R >> F >> N;

    for (int i = 1;i <= R;i ++)
    {
        cin >> r[i];
    }
    sort(r + 1,r + 1 + R);
    r[0] = -1e10;
    r[R + 1] = 1e10;

    for (int i = 1;i <= F;i ++)
    {
        cin >> x[i] >> y[i];
        a[i] = angle(x[i],y[i]);
    }
    sort(a + 1,a + 1 + F);
    a[0] = -2 * pi + a[F];
    a[F + 1] = 2 * pi + a[1];
    while (N --)
    {
        int x1, y1;
        cin >> x1 >> y1;
        double ans = 1e15;
        double Angle = angle(x1,y1);
        double l1 = dis(x1,y1);
        int l = lower_bound(a + 1,a + F + 2,Angle) - a;
        double c[4];
        c[1] = a[l],c[2] = a[l - 1];
        for (int i = 1;i <= 2;i ++)
        {
            double d = l1 * cos(c[i] - Angle);
            int l2 = lower_bound(r, r + R + 2,d) - r;
            int f[4];
            f[1] = r[l2];
            f[2] = r[l2 - 1];

            ans = min(ans,get_dis(c[i],f[1],x1,y1));
            ans = min(ans,get_dis(c[i],f[2],x1,y1));
        }
        cout << ans << "\n";
    }

}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int t = 1;
    //cin >> t;
    while (t--)
    {
        Z();
    }
    return 0;
}