Taco Transformation

Given two arrays A and B of equal length, determine whether it is possible to transform A into B by a series of increment operations (i.e. you may only increase the elements of A).

The transformation is possible if and only if for every index \(i\), \( A_i \le B_i \). Otherwise, it is impossible.

Example:
If A = [1, 2, 3, 4, 5] and B = [5, 6, 7, 8, 9], then the answer is YES because \(1\le5,\ 2\le6,\dots,\ 5\le9\).

inputFormat

The first line of input contains a single integer T representing the number of test cases.

Each test case starts with an integer n indicating the length of the arrays. This is followed by a line containing n space-separated integers representing array A, and another line with n space-separated integers representing array B.

It is guaranteed that both arrays A and B have the same length in every test case.

outputFormat

For each test case, output a single line containing either YES if array A can be transformed into B by only increment operations, or NO otherwise.

## sample

2
3
1 2 3
3 4 5
4
1 1 1 1
1 2 3 4

YES
YES

</p>