#include using namespace std; typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector> VVL; typedef pair Pair; typedef tuple tpl; #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define REVERSE(c) reverse((c).begin(),(c).end()) #define EXIST(m,v) (m).find((v)) != (m).end() #define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin() #define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin() #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i) #define RREP(i,n) RFOR(i,n,0) #define en "\n" constexpr double EPS = 1e-9; constexpr double PI = 3.1415926535897932; constexpr int INF = 2147483647; constexpr long long LINF = 1LL<<60; constexpr long long MOD = 998244353; // 1000000007; template inline bool chmax(T& a, T b){if(a inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} #include #include using S1 = bool; S1 op1(S1 a, S1 b){return a or b;} S1 e1(){return false;} using S = int; using F = int; S op(S a, S b){return max(a,b);} S e(){return -1;} F id(){return -1;} S mapping(F a, S b){return max(a,b);} F composition(F a, F b){return max(a,b);} void Main(){ int N; cin >> N; VI A(N); REP(i,N) cin >> A[i], A[i]--; VI B(N); REP(i,N) cin >> B[i], B[i]--; VI C(N,-1); REP(_,2){ deque q; REP(i,N){ while(!q.empty() and q.back() <= A[i]) q.pop_back(); q.push_back(A[i]); while(!q.empty() and q.front() != B[i]) q.pop_front(); if(!q.empty()) C[i] = q.front(); } REVERSE(A); REVERSE(B); REVERSE(C); } REP(i,N){ if(B[i] != C[i]){ cout << "No" << en; return; } } cout << "Yes" << en; return; } int main(void){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<>t; while(t--) Main(); return 0; }