做了防负数的处理，后四个点TLE，写的是哈希qaq

#include<bits/stdc++.h>
using namespace std;
const double pi=3.14;
const int inf=0x3f3f3f3f;
const int NIL=-1;
const int MOD=122777;
#define f(i,l,r) for(int i=l;i<=r;i++)
int ha[MOD*2];
bool vis[100010];
queue<int> q;
int a[100010],n,T;
int gethash(int x){
	int p=(x<0?(x%MOD+MOD)%MOD:x%MOD);
	while(ha[p]!=-1){
		if (ha[p]==x) return p;
		p++;
		if (p==MOD){
			p=0;
		}
	}
	ha[p]=x;
	return p;
} 
int read()
{
    int ans=0,flag=1;
    char ch=getchar();
    while( (ch>'9' || ch<'0') && ch!='-' ) ch=getchar();
    if(ch=='-') flag=-1,ch=getchar();
    while(ch>='0' && ch<='9') ans=ans*10+ch-'0',ch=getchar();
    return ans*flag;
}
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>T;
	while(T--){
		memset(ha,-1,sizeof(ha));
		memset(vis,0,sizeof(vis));
		cin>>n;
		for (int i=1;i<=n;i++){
			cin>>a[i];
			q.push(gethash(a[i]));
		}
		while(!q.empty()){
			if (!vis[q.front()]) cout<<ha[q.front()]<<' ';
			vis[q.front()]=1;
			q.pop();
		}
		cout<<endl;	
	}
}