#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <set>
using namespace std;
typedef vector<int> array;

typedef pair<int,int> point;
typedef set<point> potential;

int solve(const array &accel, int x20, int v0) {
    potential pot;
    queue<point> toBeProcessed;
    toBeProcessed.push(point(x20,v0));
    while (!toBeProcessed.empty()){
        point po = toBeProcessed.front();
        toBeProcessed.pop();
        if ( pot.count(po)>0 ) continue;
        pot.insert(po);
        int cx2=po.first;
        int cv = po.second;
        for ( array::const_iterator it=accel.begin() ; it!=accel.end() ; ++it ){
            int a = *it;
            int nv = cv+*it;
            int nx2 = cx2 + cv*2 + a;
            if ( nv<=0 && 0<=nx2 )
                toBeProcessed.push(point(nx2,nv));
        }
    }
    for ( int x2=0 ; x2<x20 ; ++x2 ) {
        if ( pot.count(point(x2,0))>0 )
            return x2;
    }
    return -1;
}

int main(void)
{
    int ncases;
    cin>>ncases;
    for ( int ci=0 ; ci<ncases ; ++ci ) {
        if ( ci>0 )
            cout<<endl;
        array accel;
        int na;
        cin>>na;
        for ( int i=0 ; i<na ; ++i ) {
            int a;
            cin>>a;
            accel.push_back(a);
        }
        sort(accel.begin(), accel.end());
        int nq;
        cin>>nq;
        for ( int i=0 ; i<nq ; ++i ) {
            int x20,v0;
            cin>>x20>>v0;
            x20*=2;
            v0=-v0;
            if ( v0*v0 > x20*accel.back() ) {
                cout<<"crash"<<endl;
            }
            else {
                int len=solve(accel, x20,v0);
                if ( len<0 ) {
                    cout<<"try again"<<endl;
                }
                else if ( len==0 ){
                    cout<<"perfect"<<endl;
                }
                else {
                    cout<<"good ";
                    cout.setf(ios::fixed);
                    cout<<setprecision(3);
                    cout<<((double)len*0.5)<<endl;
                }
            }
        }
    }
    return 0;
}