#include <stdio.h>

#include <math.h>

#include <algorithm>

using namespace std;

const int maxn = ;

int X,Y,M;

int Kase;

struct Node {

    double x,y;

}nodes[maxn];

int dx[] = {,,-,};

int dy[] = {-,,,};

double dist(Node a,Node b) {

    return sqrt( (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));

}

double calc(Node p) {

    double ret = 0x3f3f3f3f;

    for(int i = ; i < M; i++)

        ret = min(ret,dist(p,nodes[i]));

    return ret;

}

int main()

{

    //freopen("in.txt","r",stdin);

    scanf("%d",&Kase);

    while(Kase--) {

        scanf("%d%d%d",&X,&Y,&M);

        for(int i = ; i < M; i++)  scanf("%lf%lf",&nodes[i].x,&nodes[i].y);

        Node s;

        s.x = X/;

        s.y = Y/;

        double t = max(X,Y);

        double ansx = X/;

        double ansy = Y/;

        double ans = calc(s);

        Node tmp;

        tmp.x = ;

        tmp.y = ;

        double anstmp = calc(tmp);

        if(anstmp>ans) {

            ans = anstmp;

            ansx = ;

            ansy = ;

        }

        tmp.x = ;

        tmp.y = Y;

        anstmp = calc(tmp);

        if(anstmp>ans) {

            ans = anstmp;

            ansx = ;

            ansy = Y;

        }

        tmp.x = X;

        tmp.y = ;

        anstmp = calc(tmp);

        if(anstmp>ans) {

            ans = anstmp;

            ansx = X;

            ansy = ;

        }

        tmp.x = X;

        tmp.y = Y;

        anstmp = calc(tmp);

        if(anstmp>ans) {

            ans = anstmp;

            ansx = X;

            ansy = Y;

        }

        while(t>1e-) {

            bool flag = true;

            while(flag) {

                flag = false;

                for(int i = ; i < ; i++) {

                    Node v;

                    v.x = s.x + dx[i]*t;

                    v.y = s.y + dy[i]*t;

                    if(v.x>X||v.y>Y||v.x<||v.y<) continue;

                    double tp = calc(v);

                    if(tp>ans) {

                        ans = tp;

                        flag = true;

                        ansx = v.x;

                        ansy = v.y;

                        s = v;

                    }

                }

            }

            t = t*0.98;

        }

        printf("The safest point is (%.1f, %.1f).\n",ansx,ansy);

    }

    return ;

}