#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using pi=pair<int,int>;
const int N=100005;
int n,m,u[N],v[N],a[N],pos[N],ax[N],bx[N];
bool flag=0;
bitset<N>vis;
bool check()
{
    for(int i=1;i<=m;i++)
    {
        ax[i]=pos[u[i]],bx[i]=pos[v[i]];
        if(ax[i]>bx[i])swap(ax[i],bx[i]);
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if((ax[i]<ax[j]&&ax[j]<bx[i]&&bx[i]<bx[j]))return 0;
        }
    }
    return 1;
}
void dfs(int p)
{
    if(p>n)
    {
        if(check())
        {
            flag=1;
            for(int i=1;i<=n;i++)cout<<a[i]<<" ";
            cout<<"\n";
        }
        return;
    }
    if(flag)return;
    for(int i=1;i<=n;i++)
    {
        if(vis[i]==0)
        {
            vis[i]=1;
            a[p]=i;
            pos[i]=p;
            dfs(p+1);
            vis[i]=0;
        }
        if(flag)return;
    }
}
void solve()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>u[i]>>v[i];
    }
    flag=0;
    vis.reset();
    dfs(1);
}
int main()
{
    freopen("graperm.in","r",stdin);
    freopen("graperm.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int sid,t;
    cin>>sid>>t;
    while(t--)solve();
    return 0;
}