#include <bits/stdc++.h>

using namespace std;


#define boost ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)

typedef long long ll;

set<ll> s[100001];
ll visited[1000001];
ll indegree[100001];


int main(){
    boost;
    ll T,N,i,j,k;
    ll M;
    cin >> T;
    while(T--){
   // v.clear();
    cin >> N >> M;
    memset(visited,0,sizeof(visited));
    for(i = 0 ; i < N ; i++){
        s[i].clear();
        for(j = i+1 ; j < N ; j++){
            s[i].insert(j);
            indegree[j]++;
        }
    }

    for(i = 0 ; i < M ; i++){
        ll u,v;
        cin >> u >> v;
        u--;
        v--;
        s[min(u,v)].erase(s[min(u,v)].find(max(u,v)));
        indegree[max(u,v)]--;
    }
    ll status = 0;
    while(!status){
        status = 1;
        for(i = N-1 ; i >= 0 ; i--){
            if(!visited[i] && indegree[i] == 0){
                status = 0;
                visited[i] = 1;
                cout << i+1 << " ";
                set<ll>::iterator it;
                for(it = s[i].begin() ; it != s[i].end() ; it++)
                    indegree[*it]--;
                break;
            }
        }
    }
    cout << endl;
}
}