#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int t,a,b,c[1001];
int main()
{
    int i;
    ifstream in("carte2.in");
    ofstream out("carte2.out");
    in>>t;
    for(i=1; i<=t; i++)
    {
        in>>a>>b;
        if(a>b)
            swap(a,b);
        in>>c[1]>>c[2]>>c[3];
        sort(c+1,c+4);
        if(c[3]>b&&c[2]>a)
            out<<"posibil"<<'\n';
        else
            out<<"imposibil"<<'\n';
    }

    return 0;
}