#include <stdio.h>

int read_tree()
{
	int i, left, right;
	int a[4];

	for(i = 0; i < 4; i++) {
		scanf( "%d", &a[i] );
	}

	if( a[0] != 0 ) {
		left = a[0];
	} else {
		left = read_tree();
	}

	if( a[2] != 0 ) {
		right = a[2];
	} else {
		right = read_tree();
	}

	if( left == -1 || right == -1 ) {
		return -1;
	} else if ( left * a[1] != right * a[3] ) {
		return -1;
	} else {
		return left + right;
	}
}

int main()
{
	int n;	
	scanf("%d", &n);
	
	while( n-- ) {
		if( read_tree() == -1 ) {
			printf("NO\n");
		} else {
			printf("YES\n");
		}

		if( n ) {
			printf("\n");
		}
	}
}