#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;
typedef long long ll;
typedef long double lb;
#define all(v) v.begin(), v.end()
#define M_PI 3.14159265358979323846


lb getdist(ll x, ll y, ll r, lb a){
    // cout << r * cos(a) << ' ' << r * sin(a) << ' ';

    lb dx = x - r * cos(a);
    lb dy = y - r * sin(a);

    return dx*dx + dy*dy;
}

ll n, m, q;
ll x, y, r;

vector<ll> vr;
vector<lb> angle;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed;
    cout.precision(12);

    cin >> n >> m >> q;
    
    for (int i = 1; i <= n; i++){
        cin >> r;
        vr.push_back(r);
    }
    for (int i = 1; i <= m; i++){
        cin >> x >> y;
        angle.push_back(atan2(y,x));
    }

    sort(all(vr));
    sort(all(angle));

    vector<lb> tmp;
    for (int i = 0; i < m; i++){
        tmp.push_back(angle[i] - 2*M_PI);
    }
    for (int i = 0; i < m; i++){
        tmp.push_back(angle[i]);
    }
    for (int i = 0; i < m; i++){
        tmp.push_back(angle[i] + 2*M_PI);
    }

    // for (int i = 0; i < n; i++){
    //     cout << vr[i] << ' ';
    // }
    // cout << endl;
    // for (int i = 0; i < m; i++){
    //     cout << angle[i] * 180 / M_PI << endl;

    //     // if (i % m == m-1) cout << endl;
    // }
    // cout << endl;
    // for (int i = 0; i < 3*m; i++){
    //     cout << tmp[i] * 180 / M_PI << endl;

    //     if (i % m == m-1) cout << endl;
    // }
    // cout << endl;
    // cout << endl;

    while (q--){
        cin >> x >> y;

        int left = 0;
        int right = n - 1;

        while (left < right){
            int mid = (left + right + 1) / 2;

            if (x*x+y*y >= vr[mid]*vr[mid]){
                left = mid;
            }else{
                right = mid - 1;
            }
        }

        // cout << x << ' ' << y << ' ' << vr[left] << '\n';

        int lr = left;
        lb theta = atan2(y, x);

        int lt = 0;

        left = 0;
        right = 3*m - 1;

        while (left < right){
            int mid = (left + right + 1) / 2;

            if (tmp[mid] > theta) right = mid - 1;
            else left = mid;
        }

        // cout << angle[left].deg << ' ' << theta << ' ' << angle[right].deg << endl;

        lt = left;
        
        // cout << lt << ' ' << rt << endl;

        lb dist = 9e18;

        for (int ridx = lr; ridx <= lr+1; ridx++){
            if (ridx < 0) continue;
            if (ridx >= n) continue;

            for (int tidx = lt-3; tidx <= lt+3; tidx++){
                if (tidx < 0) continue;

                lb d = getdist(x, y, vr[ridx], angle[(tidx)%m]);
                // cout << d << endl;

                dist = min(dist, d);
            }
        }

        cout << sqrt(dist) << '\n';
        // cout << endl;
    }

}