#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

struct Pine {
	double x[3];
	double y[3];
};

template<typename T>
inline int Max(T begin, T end) {
	return distance(begin, max_element(begin, end));
}

template<typename T>
inline int Min(T begin, T end) {
	return distance(begin, min_element(begin, end));
}

template<typename T>
inline bool HasEqual(const T x[]) {
	return x[0] == x[1] || x[0] == x[2] || x[1] == x[2];
}

int main(){
	int n;
	cin >> n;

	vector<Pine> pines;

	for (int i = 0; i < n; i++) {
		Pine p;
		cin >> p.x[0] >> p.x[1] >> p.x[2] >> p.y[0] >> p.y[1] >> p.y[2];
		pines.emplace_back(p);
	}

	for (Pine p : pines) {
		if (!HasEqual(p.x) && (Max(p.x, p.x + 3) == 1 || Min(p.x, p.x + 3) == 1)) {
			cout << "YES" << endl;
			continue;
		}

		bool yes = false;
		while (!(Max(p.x, p.x+3) == Max(p.y, p.y + 3)) && !(Min(p.x, p.x + 3) == Min(p.y, p.y + 3))) {
			p.x[0] += p.y[0]*0.001;
			p.x[1] += p.y[1]*0.001;
			p.x[2] += p.y[2]*0.001;
			if (*max_element(p.x, p.x + 3) == p.x[1] || *min_element(p.x, p.x + 3) == p.x[1]) {
				yes = true;
				break;
			}
		}
		cout << (yes ? "YES" : "NO") << endl;
	}

	return 0;
}