You are given an array \(A\) of \(N\) integers where the \(i^{th}\) element denotes that Bob has \(A[i]\) buckets of color \(i\).

In one move, Bob can pick two buckets with the same color and transform them into a bucket of any other color.

Now, Bob is also given an array \(B\) of \(N\) integers where the \(i^{th}\) element denotes that Bob needs at least \(B[i]\) buckets of color \(i\). Find if it is possible for Bob to get the required number of buckets for each color using the specified moves. If possible, print 'Yes' else 'No' without quotes.

Note:

• 1-based indexing is followed.

Input format

• The first line contains an integer \(T\) denoting the number of test cases. 
• The first line of each test case contains an integer \(N\).
• The second line of each test case contains \(N\) space-separated integers denoting array \(A\).
• The third line of each test case contains \(N\) space-separated integers denoting array \(B\).

Output format

For each test case, print 'Yes' if it is possible for Bob to get the required number of buckets for each color. Otherwise, print 'No'. Print the output in a new line.

Constraints

\(1 \le T \le 10 \\ 1 \le N \le 10^3 \\ 0 \le A[i], B[i] \le 10^5\)