#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("carte2.in");
ofstream fout("carte2.out");
int t, v[4], v1[3], n, m;
int main()
{
    fin >> t;
    for (int i = 0; i < t; i++)
    {
        fin >> v1[0] >> v1[1];
        for (int i = 0; i < 3; i++)
        {
            fin >> v[i];
        }
        sort(v1, v1 + 2, greater<int>());
        sort(v, v + 3, greater<int>());
        if (v[0] > v1[0] && v[1] > v1[1]) fout << "posibil" << endl;
        else
            fout << "imposibil" << endl;
    }
    return 0;
}