1672D - Cyclic Rotation - CodeForces Solution

    
    
        
        
    
    

            
def ss(a,b):
    d={i:0 for i in b}

            if a[-1]!=b[-1]:
        return "NO"
    n=len(a)
    i=n-1
    j=n-1
    
    while i>=0 and j>=0:
        while j>=1  and b[j]==b[j-1]:
            x=b[j]
            d[x]+=1
            j-=1  
        
        if a[i]==b[j]:
            i-=1 
            j-=1 
            
        
        elif d[a[i]]>0:
            x=a[i]
            i-=1 
            d[x]-=1 
        else:
            return "NO"
    
    return "YES"


    
    
import collections


def transform(a, b):
    counter = collections.Counter()
    while a:
        while len(b) > 1 and b[-1] == b[-2]:
            counter[b.pop()] += 1
        if b and a[-1] == b[-1]:
            a.pop()
            b.pop()
        elif counter[a[-1]]:
            counter[a.pop()] -= 1
        else:
            return False
    return True


for _ in range(int(input())):
    input()
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    print("YES" if transform(a, b) else "NO")