求两个能AC的hash模数

#include<bits/stdc++.h>
#define ll long long
#define back return
#define ri register int
using namespace std;
ll read()
{
	ll x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')
			f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=x*10+ch-'0';
		ch=getchar();
	}
	back x*f;
}
const int p=23068673,p1=19491001;
ll t,n;
int a[50005];
bool hash1[23068674],hash2[20000000];
int main()
{
	t=read();
	while(t--)
	{
		n=read();
		for(ri i=1;i<=n;i++)
			a[i]=read(),hash1[(a[i]%p+p)%p]=1,hash2[(a[i]%p1+p1)%p1]=1;
		for(ri i=1;i<=n;i++)
		{
			int lsbl1=(a[i]%p+p)%p,lsbl2=(a[i]%p1+p1)%p1;
			if(hash1[lsbl1]||hash2[lsbl2])
				cout<<a[i]<<" ",hash1[lsbl1]=hash2[lsbl2]=0;
		}	
		cout<<"\n";
	}
	back 0;
}