#include <bits/stdc++.h>
#define int long long
using namespace std;
int c,T;
const int N=1e5+10;
int n,m;
vector<int>l[N];
int u[N],v[N];
bool st[N];
int ans[N];
bool flag;
int p[N];
int a[N],b[N];
bool check() {
    for(int i=1;i<=n;i++)p[ans[i]]=i;
    for(int i=1;i<=m;i++) a[i]=min(p[u[i]],p[v[i]]),b[i]=max(p[u[i]],p[v[i]]);
    for(int i=1;i<=m;i++)
        for(int j=1;j<i;j++)if((a[i]<a[j]&&a[j]<b[i]&&b[i]<b[j])||(a[j]<a[i]&&a[i]<b[j]&&b[j]<b[i]))return 0;
    return 1;
}

void dfs(int u) {
    if(u==n+1) {
        if(check()) {
            for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
            cout<<endl;
            flag=1;
        }
    }
    for(int i=1;i<=n;i++) {
        if(st[i])continue;
        st[i]=1;
        ans[u]=i;
        dfs(u+1);
        if(flag)return;
        st[i]=0;
    }
    return;
}
void solve() {
    cin>>n>>m;
    for(int i=1;i<=m;i++)cin>>u[i]>>v[i];
    for(int i=1;i<=n;i++)st[i]=0;
    flag=0;
    dfs(1);
    return;
}
signed main()
{
    freopen("graperm.in","r",stdin);
    freopen("graperm.out","w",stdout);
    cin>>c>>T;
    while(T--)solve();
    return 0;
}