#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int t=0;char h=getchar();
	while(!isdigit(h))h=getchar();
	while(isdigit(h))t=(t<<1)+(t<<3)+(h^48),h=getchar();
	return t;
}
void write(int x)
{
	if(x>9)write(x/10);putchar(x%10+'0');
}
const int N=2e5+10;
int n,m;
int rk[N],ans[N],a[N],b[N];
bool vis[N];
bool check()
{
	for(int i=1;i<=m;i++)
		for(int j=1;j<=m;j++)
		{
//			cout<<rk[a[i]]<<" "<<rk[a[j]]<<" "<<rk[b[i]]<<" "<<rk[b[j]]<<endl;
//			cout<<(rk[a[i]]<rk[a[j]])<<" "<<(rk[a[j]]<rk[b[i]])<<" "<<(rk[b[i]]<rk[b[j]])<<endl;
			if(rk[a[i]]<rk[a[j]]&&rk[a[j]]<rk[b[i]]&&rk[b[i]]<rk[b[j]])return false;
		}
	for(int i=1;i<=n;i++)write(ans[i]),putchar(' ');puts("");
	return true;
}
bool f;
void dfs(int x)
{
	if(f)return;
	if(x>n)
	{
		if(check())f=true;
		return;
	}
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			ans[x]=i;rk[i]=x;vis[i]=true;
			dfs(x+1);
			vis[i]=false;
		}
	}
}
inline void solve()
{
	n=read();m=read();
	for(int i=1;i<=m;i++)a[i]=read(),b[i]=read();
	dfs(1);
//	for(int i=1;i<=n;i++)write(ans[i]),putchar(' ');puts("");
	f=false;
	for(int i=1;i<=n;i++)ans[i]=rk[i]=0;
}
int main()
{
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	
	int c=read(),t=read();
	while(t--)
	{
		solve();
	}
	return 0;
}