#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

int main() {
    ifstream f("carte2.in");
    ofstream g("carte2.out");

    int t, a, b, c, d, e;

    f >> t;
    for (int i = 0; i < t; ++i) {
        f >> a >> b >> c >> d >> e;

        priority_queue<int> pq1, pq2;
        pq1.push(a);
        pq1.push(b);

        pq2.push(c);
        pq2.push(d);
        pq2.push(e);

        if (pq1.top() >= pq2.top()) {
            g << "imposibil\n";
            continue;
        }

        pq1.pop();
        pq2.pop();

        if (pq1.top() >= pq2.top()) {
            g << "imposibil\n";
            continue;
        }

        g << "posibil\n";
    }

    return 0;
}