#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 19260817
#define int long long
using namespace std;
int T;
int n,a[N];
struct hash_table{
	int val[N],key[N],m=19260817;
	void clear(){memset(key,0,sizeof(key));}
	int hs(int x){return ((x%m*7)%m*13)%m;}
	int& operator[](int p){
		int x=hs(p);
		int t=x;
		while(key[t]!=0&&key[t]!=x)if(++t==m)t=0;
		key[t]=x;
		return val[t];
	}
}h;
signed main(){
	scanf("%lld",&T);
	while(T--){
		scanf("%lld",&n);
		for(int i=1;i<=n;i++){
			scanf("%lld",&a[i]);
			if(h[a[i]]==0)h[a[i]]=1;
		}
		for(int i=1;i<=n;i++){
			if(h[a[i]]==1)printf("%lld ",a[i]),h[a[i]]--;
		}
		puts("");
	}
	return 0;
}