#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("carte2.in");
ofstream out("carte2.out");
int v[10];

void solve()
{
    int a, b;
    in >> a >> b;
    for(int i = 1; i <= 3; i++)
        in >> v[i];
    sort(v + 1, v + 4);
    reverse(v + 1, v + 4);
    if(a < b)
        swap(a, b);
    if(a < v[1] && b < v[2])
        out << "posibil";
    else
        out << "imposibil";
    out << "\n";
}

int main()
{
    int T;
    in >> T;
    for(int i = 1; i <= T; i++)
        solve();
    return 0;
}