#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;

int T, d[2] = {2, 3};
vector<int> s[2];

int main() {
	freopen("carte2.in", "rt", stdin);
	freopen("carte2.out", "wt", stdout);

	int x;
	scanf("%d", &T);
	assert(T >= 1 && T <= 200);
	while (T--) {
		for (int i = 0; i < 2; i++) {
			s[i].clear();
			for (int j = 0; j < d[i]; j++) {
				scanf("%d", &x);
				assert(x >= 1 && x <= 1000);
				s[i].push_back(x);
			}
			sort(s[i].begin(), s[i].end());
		}
		if (s[0][0] < s[1][1] && s[0][1] < s[1][2]) {
			printf("posibil\n");
		} else {
			printf("imposibil\n");
		}
	}

	fclose(stdout);
	return 0;
}