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:

  1. 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. 
  2. Add a_i to a_j. In other words, j-th element of the array becomes equal to a_i + a_j. 



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 ≤ 10^5) — the length of arrays.

The second line of each test case contains n integers a_1, a_2, ..., a_n (-1 ≤ a_i ≤ 1) — elements of array a. There can be duplicates among elements.

The third line of each test case contains n integers b_1, b_2, ..., b_n (-10^9 ≤ b_i ≤ 10^9) — 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 10^5.

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

Input


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


Output


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.
import java.util.*;
import java.lang.*;
import java.io.*;

public final class Codeforces
{
    public static void main (String[] args) throws java.lang.Exception
    {
        BufferInput bufferInput = new BufferInput();
        BufferOutput bufferOutput = new BufferOutput();

        int t = bufferInput.nextInt();

        while(t-- > 0){
            int n = bufferInput.nextInt();

            int[] arrA = new int[n];
            int[] arrB = new int[n];

            int flag = 1;

            HashMap<Integer, Integer> hMap = new HashMap<>();

            for(int i = 0; i < n; i++){
                arrA[i] = bufferInput.nextInt();

                if(!hMap.containsKey(arrA[i])){
                    hMap.put(arrA[i], i);
                }

            }
            for(int i = 0; i < n; i++){
                arrB[i] = bufferInput.nextInt();

            }

            for(int i = n - 1; i >= 0; i--){
                if(arrA[i] == arrB[i])
                    continue;
                else if(arrA[i] < arrB[i]){
                    if(hMap.getOrDefault(1, -1) == -1 || hMap.getOrDefault(1, -1) >= i){
                        flag = 0;
                    }
                }
                else{
                    if(hMap.getOrDefault(-1, -1) == -1 || hMap.getOrDefault(-1, -1) >= i){
                        flag = 0;
                    }
                }
            }




            String ans = (flag == 1) ? "YES" : "NO";
            bufferOutput.writeString(ans + "\n");
        }

        bufferOutput.flush();
    }

}

class BufferInput {

    /**
     *  A constant holding default buffer size, 2<sup>16</sup> bytes of memory.
     *
     **/
    final private int BUFFER_SIZE = 1 << 16;

    private DataInputStream din;

    private byte[] buffer;

    private int bufferPointer, bytesRead;

    public BufferInput() {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public BufferInput(String file_name) throws IOException {
        din = new DataInputStream(new FileInputStream(file_name));
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    /**
     * Reads the input bytes until it encounters a new line char.
     * @return
     * @throws IOException
     */
    public String readLine() throws IOException {
        byte[] buf = new byte[64];
        int cnt = 0, c;
        while ((c = read()) != -1) {
            if (c == '\n')
                break;
            buf[cnt++] = (byte) c;
        }
        return new String(buf, 0, cnt);
    }

    /**
     *
     * @return
     * @throws IOException
     */
    public String nextString() throws IOException{

        // Skip all whitespace characters from the stream
        byte c = read();
        while(Character.isWhitespace(c)){
            c = read();
        }

        StringBuilder builder = new StringBuilder();
        builder.append((char)c);
        c = read();
        while(!Character.isWhitespace(c)){
            builder.append((char)c);
            c = read();
        }

        return builder.toString();
    }

    /**
     * Reads an integer value.
     * @return
     * @throws IOException
     */
    public int nextInt() throws IOException {
        int ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do {
            ret = ret * 10 + c - '0';
        } while ((c = read()) >= '0' && c <= '9');

        if (neg)
            return -ret;
        return ret;
    }


    /**
     * Reads an array of integers.
     * @return
     * @throws IOException
     */
    public int[] nextIntArray(int n) throws IOException {
        int arr[] = new int[n];
        for(int i = 0; i < n; i++){
            arr[i] = nextInt();
        }
        return arr;
    }


    /**
     * Reads a long value.
     * @return
     * @throws IOException
     */
    public long nextLong() throws IOException {
        long ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do {
            ret = ret * 10 + c - '0';
        } while ((c = read()) >= '0' && c <= '9');
        if (neg)
            return -ret;
        return ret;
    }


    /**
     * Reads an array of long integers.
     * @return
     * @throws IOException
     */
    public long[] nextLongArray(int n) throws IOException {
        long arr[] = new long[n];
        for(int i = 0; i < n; i++){
            arr[i] = nextLong();
        }
        return arr;
    }

    /**
     *
     * @return
     * @throws IOException
     */
    public char nextChar() throws IOException{
        byte c = read();
        while(Character.isWhitespace(c)){
            c = read();
        }
        return (char) c;
    }


    /**
     * Reads a double value.
     * @return
     * @throws IOException
     */
    public double nextDouble() throws IOException {
        double ret = 0, div = 1;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();

        do {
            ret = ret * 10 + c - '0';
        } while ((c = read()) >= '0' && c <= '9');

        if (c == '.') {
            while ((c = read()) >= '0' && c <= '9') {
                ret += (c - '0') / (div *= 10);
            }
        }

        if (neg)
            return -ret;
        return ret;
    }

    /**
     * Reads an array of double values.
     * @return
     * @throws IOException
     */
    public double[] nextDoubleArray(int n) throws IOException {
        double arr[] = new double[n];
        for(int i = 0; i < n; i++){
            arr[i] = nextDouble();
        }
        return arr;
    }

    /**
     * Fills the buffer from input stream.
     *
     * @throws IOException
     */
    private void fillBuffer() throws IOException {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1)
            buffer[0] = -1;
    }

    /**
     *
     * @return
     * @throws IOException
     */
    private byte read() throws IOException {
        if (bufferPointer == bytesRead)
            fillBuffer();
        return buffer[bufferPointer++];
    }

    public void close() throws IOException {
        if (din == null)
            return;
        din.close();
    }
}

class BufferOutput {

    private DataOutputStream dout;

    /**
     *  A constant holding default buffer size, 2<sup>16</sup> bytes of memory.
     *
     **/
    final private int BUFFER_SIZE = 1 << 16;


    private byte[] buffer;

    /**
     * The current position in the buffer for next byte to be written.
     */
    private int pointer = 0;

    /**
     * Creates an instance of {@link BufferOutput} with {@link DataOutputStream}
     * linked to the console output stream.
     */
    public BufferOutput() {
        buffer = new byte[BUFFER_SIZE];
        dout = new DataOutputStream(System.out);
    }

    /**
     * Creates an instance of {@link BufferOutput} with {@link DataOutputStream}
     * linked to the {@link OutputStream} specified by the out.
     */
    public BufferOutput(OutputStream out) {

        buffer = new byte[BUFFER_SIZE];
        dout = new DataOutputStream(out);
    }

    /**
     * Writes the array of bytes to the buffer.
     *
     * If buffer doesn't have enough space to accommodate the array,
     * the contents of buffer are written to the output stream.
     *
     * @param arr
     * @throws IOException
     */
    public void writeBytes(byte arr[]) throws IOException {

        int bytesToWrite = arr.length;

        if (pointer + bytesToWrite >= BUFFER_SIZE) {
            flush();
        }

        for (int i = 0; i < bytesToWrite; i++) {
            buffer[pointer++] = arr[i];
        }
    }

    /**
     * Writes the string as array of bytes to the buffer.
     *
     * @param str
     * @throws IOException
     */
    public void writeString(String str) throws IOException {
        writeBytes(str.getBytes());
    }

    /**
     * Writes the contents of full buffer to the output stream.
     *
     * @throws IOException
     */
    public void flush() throws IOException {
        dout.write(buffer, 0, pointer);
        dout.flush();
        pointer = 0;
    }

    public void close() throws IOException{
        dout.close();
    }
}

class Pair{

    public int index;
    public int flag;

    public Pair(int index, int flag){
        this.index = index;
        this.flag = flag;
    }

    public void print(){
        System.out.println(index + " : " + flag);
    }
}

