#include <iostream>
#include <fstream>
#include <algorithm>    // std::make_heap, std::pop_heap, std::push_heap, std::sort_heap
#include <vector>       // std::vector
using namespace std;
int main(){
ofstream fout;
  fout.open ("carte2.out");
ifstream fin;
  fin.open ("carte2.in");
 int n;
fin>>n;  
int A[2];
int B[3];

for(int i=0;i<n;i++){

fin>>A[0];
fin>>A[1];
fin>>B[0];
fin>>B[1];
fin>>B[2];

int f = max(A[0],A[1]);
int s = min(A[0],A[1]);

 std::vector<int> v(B,B+3);

  std::make_heap (v.begin(),v.end());
  if (v.front()<=f){
	fout<<"imposibil";
		continue;
		}
std::pop_heap (v.begin(),v.end()); v.pop_back();
  if (v.front()<=s){
	fout<<"imposibil";
		continue;
	}
fout<<"posibil";	

fout<<'\n';
}
return 0;
}