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

using namespace std;

int main(){

	priority_queue<int> Q;
	ifstream fin("carte2.in");
	ofstream fout("carte2.out");
	int T;
	int x,a,b,c,d;
	fin>>T;
	while ( T--){
		fin>>a>>b;
		for (int i=0;i<3;++i){

			fin>>x;
			Q.push(x);
		}
		d = Q.top();
		Q.pop();
		c = Q.top();

		if ( (a < c && b < d) || ( a < d && b < c)) fout<<"posibil"<<'\n';
		else fout<<"imposibil"<<'\n';	
		Q.empty();
	}

	fin.close();
	fout.close();
	return 0;
}