#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;

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

void sortCarte(int& carteX, int& carteY) {
	if (carteX < carteY) {
		swap(carteX, carteY);
	}
}

int maxi(int a, int b) {
	if (a > b) {
		return a;
	}
	return b;
}

void sortBox(int& a, int& b, int& c) {
	int maximum = maxi(a, maxi(b, c));
	int secondMax;
	if (a == maximum) {
		secondMax = maxi(b, c);
	}
	else {
		if (b == maximum) {
			secondMax = maxi(a, c);
		}
		else {
			secondMax = maxi(a, b);
		}
	}
	a = maximum;
	b = secondMax;
}

int main() {
	int n;
	int carteX, carteY, boxX, boxY, boxZ;
	f >> n;
	for (int i = 0; i < n; ++i) {
		f >> carteX >> carteY >> boxX >> boxY >> boxZ;
		sortCarte(carteX, carteY);
		sortBox(boxX, boxY, boxZ);
		if (carteX < boxX && carteY < boxY) {
			g << "posibil" << endl;
		} else{
			g << "imposibil" << endl;
		}

	}
}