#include<bits/stdc++.h>
using namespace std;
const double pi=asin(-1);
const double eps=1e-9;
double sqr(double x)
{
    return x*x;
}
double len(double x,double y)
{
    return sqrt(sqr(x)+sqr(y));
}
double r[100010],an[100010];
int main()
{
    int rr,f,n;
    scanf("%d%d%d",&rr,&f,&n);
    for (int i=1;i<=n;i++)
        scanf("%lf",&r[i]);
    sort(r+1,r+1+rr);
    scanf("%d",&f);
    for (int i=1;i<=f;i++)
    {
        double x,y;
        scanf("%lf%lf",&x,&y);
        an[i] = atan2(y,x);
        if (an[i] < -eps) an[i]+=pi*2;
    }
    sort(an+1,an+1+f);
    for (int i=1;i<=f;i++)
        an[i+f] = an[i] + pi*2;
    while (n--)
    {
        double x,y;
        scanf("%lf%lf",&x,&y);
        double ang = atan2(y,x);
        if (ang<-eps) ang+=pi*2;
        double R = sqrt(sqr(x)+sqr(y));
        int ar = lower_bound(an+1,an+1+f*2,ang) - an;
        int al = ar-1;
        int ca;
        double da;
        double dr = an[ar] - ang;
        double dl = ang - an[al];
        if (dr < -eps) dr+=2*pi;
        if (dr > 2*pi) dr-=2*pi;
        if (dl < -eps) dl+=2*pi;
        if (dl > 2*pi) dl-=2*pi;
        if (dl < dr) ca = al,da = dl;
        else ca = ar,da = dr;
        double r1 = R * cos(da);
        int lr = lower_bound(r+1,r+1+rr,r1) - r;
        int ll = lr-1;
        double ans=1e9;
        printf("%.6lf %d\n",da,lr);
        if (lr <= rr)
        {
            ans=min(ans,len(r[lr] * cos(da)-x,r[lr]*sin(da)-y));
        }
        if (ll > 0)
            ans=min(ans,len(r[ll]*cos(da)-x,r[ll]*sin(da)-y));
        printf("%.9lf\n",ans);
    }
    return 0;
}