cf#632div2 B

Once again, Boris needs the help of Anton in creating a task. This time Anton needs to solve the following problem:

There are two arrays of integers a and b of length n. It turned out that array a contains only elements from the set {−1,0,1}.

Anton can perform the following sequence of operations any number of times:

Choose any pair of indexes (i,j) such that 1≤i<j≤n. It is possible to choose the same pair (i,j) more than once.
Add ai to aj. In other words, j-th element of the array becomes equal to ai+aj.
For example, if you are given array [1,−1,0], you can transform it only to [1,−1,−1], [1,0,0] and [1,−1,1] by one operation.

Anton wants to predict if it is possible to apply some number (zero or more) of these operations to the array a so that it becomes equal to array b. Can you help him?

Input

Each test contains multiple test cases.

The first line contains the number of test cases t (1≤t≤10000). The description of the test cases follows.

The first line of each test case contains a single integer n (1≤n≤105) — the length of arrays.

The second line of each test case contains n integers a1,a2,…,an (−1≤ai≤1) — elements of array a. There can be duplicates among elements.

The third line of each test case contains n integers b1,b2,…,bn (−109≤bi≤109) — elements of array b. There can be duplicates among elements.

It is guaranteed that the sum of n over all test cases doesn’t exceed 105.

Output

For each test case, output one line containing “YES” if it’s possible to make arrays a and b equal by performing the described operations, or “NO” if it’s impossible.

You can print each letter in any case (upper or lower).

Example

inputCopy

5
3
1 -1 0
1 1 -2
3
0 1 1
0 2 2
2
1 0
1 41
2
-1 0
-1 -41
5
0 1 -1 1 -1
1 1 -1 1 -1

outputCopy

YES
NO
YES
YES
NO
Note
In the first test-case we can choose (i,j)=(2,3) twice and after that choose (i,j)=(1,2) twice too. These operations will transform [1,−1,0]→[1,−1,−2]→[1,1,−2]
In the second test case we can’t make equal numbers on the second position.

In the third test case we can choose (i,j)=(1,2) 41 times. The same about the fourth test case.

In the last lest case, it is impossible to make array a equal to the array b.

#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
int main()
{
    int T,A[100000],B[100000],n,i,j,m1,m2,b;
    cin>>T;
    while(T--)
    {
        cin>>n;
        m1=0;
        m2=0;
        for(i=0;i<n;++i)
        {
            cin>>A[i];
            if(A[i]>A[m1])m1=i; ///取最前面的1的下标
            if(A[i]<A[m2])m2=i; ///取最前面的-1的下标 
        }
 
        for(i=0;i<n;++i)cin>>B[i];
        if(A[m1]!=1)m1=n; ///说明前面不存在1 
        if(A[m2]!=-1)m2=n;///说明前面不存在-1 
        for(i=n-1;i>=0;--i)
        {
            if((B[i]>A[i]&&m1>=i)||(B[i]<A[i]&&m2>=i)){cout<<"NO";break;} ///当需要用到1或-1时 
        }
        if(i<0)cout<<"YES";
        cout<<endl;
    }
}