Equal Multisets (Easy Version).cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- Equal Multisets
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

void solve(vector<int> &a,vector<int> &b,int k)
{
	int n = a.size();
	unordered_set<int> st;
	for(int &x:b)
	{
		if(x==-1) continue;
		if(st.find(x)!=st.end())
		{
			cout<<"NO"<<endl;
			return;
		}
		st.insert(x);
	}
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n,k;
		cin>>n>>k;
		vector<int> a(n);
		for (auto &x:a) 
			cin>>x;
		vector<int> b(n);
		for(int &x:b)
			cin>>x;
		solve(a,b,k);
	}	
	return 0;
}