#include <bits/stdc++.h>
#include <algorithm>

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ll long long
#define pii pair<int,int>
#define tii tuple <int,int,int>
#define N 1000001
#define mod 1000000005
#define X first
#define Y second
#define eps 0.0000000001
#define all(x) x.begin(),x.end()
#define tot(x) x+1,x+n+1
using namespace std;



string file="carte2";


vector<int>v,w;
int a,b,c,d,e,ok,t;
int main()
{
    freopen("carte2.in","r",stdin);
    freopen("carte2.out","w",stdout);
    scanf("%d",&t);
    for(; t; t--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
        v.clear();
       w.clear();
        v.pb(a);
        v.pb(b);
        w.pb(c);
        w.pb(d);
        w.pb(e);
        sort(all(v));
        sort(all(w));
        ok=0;
        do
        {
            do
            {
                if(v[0]<w[0]&&v[1]<w[1])
                    ok=1;
            }
            while(next_permutation(all(w))&&!ok);
        }
        while(next_permutation(all(v))&&!ok);
        if(ok)
        {
            printf("posibil\n");
        }
        else
            printf("imposibil\n");
    }
    return 0;
}