#include <queue>

 #include <cstdio>

 #include <vector>

 #include <cstring>

 using namespace std;

 const int maxn = 3e4 + ;

 int t, n, m, u, v, rk;

 int InDeg[maxn], Rank[maxn];

 vector<int> G[maxn];

 void topsort() {

     priority_queue<int> q;

     for(int i = ; i <= n; i++) {

         if(InDeg[i] == ) q.push(i);

     }

     int x;

     while(!q.empty()) {

         x = q.top(), q.pop();

         Rank[rk++] = x;

         int t = G[x].size();

         for(int i = ; i < t; i++) {

             if(--InDeg[G[x][i]] == ) q.push(G[x][i]);

         }

     }

 }

 int main() {

     scanf("%d", &t);

     while(t--) {

         scanf("%d%d", &n, &m);

         for(int i = ; i <= n; i++) {

             G[i].clear();

         }

         memset(InDeg, , sizeof(InDeg));

         for(int  i = ; i < m; i++) {

             scanf("%d%d", &u, &v);

             G[v].push_back(u);

             InDeg[u]++;

         }

         rk = ;

         topsort();

         for(int i = n - ; i >= ; i--) {

             if(i != (n - )) {

                 printf(" ");

             }

             printf("%d", Rank[i]);

         }

         printf("\n");

     }

     return ;

 }