#include <cassert>
#include <fstream>
#include <cstring>
#include <queue>
#include <algorithm>
#include <bitset>
#include <ctime>
#include <set>
#include <cmath>
#include <iomanip>
#include <map>
#include <stack>
#include <vector>
#include <bitset>

#include <fstream>

using namespace std;

#define FOR(i, a, n) for (int i = a; i <= n; ++i)
#define ROF(i, n, a) for (int i = n; i >= a; i--)
#define FIT(i, v) for (auto &i : v)
#define pb push_back
#define mp make_pair
#define mt make_touple
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
typedef long long ll;
typedef pair<int,int> pii;
const int mod = 1000000009;
ll powmod(ll a, ll b) {ll res=1; a %= mod; assert(b >= 0); for(; b; b >>= 1) {if (b & 1) res = res * a % mod; a = a * a % mod;} return res;}

const int N = 100005;

ifstream fin("carte2.in");
ofstream fout("carte2.out");

int main() {
    int T;
    fin >> T;
    while (T--) {
        int a,b,c,d,e;
        fin >> a >> b >> c >> d >> e;
        if ((a < c && b < d) || (a < d && b < c) || (a < d && b < e) || (a < e && b < d) || (a < c && b < e) || (a < e && b < c)) {
            fout << "posibil\n";
        } else {
            fout << "imposibil\n";
        }
    }
    
    return 0;
}