#include<bits/stdc++.h>
#define INF 1e9
#define LLINF 1e18
#define inf 0x3f3f3f3f
#define ll long long
#define FILE1(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define FILE2(x) freopen(x".in","r",stdin),freopen(x".ans","w",stdout)
#define FILE3(x) freopen(x".in","r",stdin)
#define Mod 998244353
#define N 100005
using namespace std;
int read(){
    int x=0,f=1,ch=getchar();
    for(;!isdigit(ch);ch=getchar()) f=(ch=='-')?-1:1;
    for(;isdigit(ch);ch=getchar()) x=(x<<3)+(x<<1)+(ch^48);
    return x*f;
}
int add(int x,int y){return x+y>=Mod?x+y-Mod:x+y;}
int del(int x,int y){return add(x,Mod-y);}
int mul(int x,int y){return ((ll)x*y)%Mod;}
void Add(int &x,int y){x=add(x,y);}
void Del(int &x,int y){x=del(x,y);}
void Mul(int &x,int y){x=mul(x,y);}
int cid,T,n,m,p[N],q[N];
vector<int>vec[N];
pair<int,int>ed[N];
bool vis[N];
void solve(){
    n=read(),m=read();
    for(int i=1;i<=n;++i) p[i]=i;
    for(int i=1;i<=m;++i) ed[i]={read(),read()};
    do{
        for(int i=1;i<=n;++i) q[p[i]]=i;
        for(int i=1;i<=n;++i) vector<int>().swap(vec[i]);
        for(int i=1;i<=n;++i) vis[i]=false;
        for(int i=1;i<=m;++i){
            int l=ed[i].first,r=ed[i].second;
            l=q[l],r=q[r];
            if(l>r) swap(l,r);
            vec[l].push_back(r);
        }
        bool ok=true;
        for(int i=1;i<=n && ok;++i){
            for(int j:vec[i]){
                for(int k=i+1;k<j;++k){
                    if(vis[k]){
                        ok=false;
                        break;
                    }
                }
                if(!ok) break;
            }
            for(int j:vec[i]) vis[j]=true;
        }
        if(ok){
            for(int i=1;i<=n;++i) printf("%d ",p[i]);
            break;
        }
    }while(next_permutation(p+1,p+n+1));
    puts("");
}
int main(){
    FILE1("graperm");
    cid=read(),T=read();
    while(T--) solve();
    return 0;
}