#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<queue>

 #include<vector>

 using namespace std;

 const int maxn = +;

 priority_queue<int> que;

 vector<int> vt[maxn];

 int du[maxn],ans[maxn];

 int main()

 {

     int T,n,m;

     scanf("%d",&T);

     while(T--)

     {

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

         int u,v;

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

         vt[i].clear();

         memset(du,,sizeof(du));

         while(m--)

         {

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

             du[u]++;

             vt[v].push_back(u);

         }

         for(int i = ;i <= n;++i) //把出度为0的先加到优先队列中

         if(!du[i]) que.push(i);

         int f = n - ;

         while(!que.empty())

         {

             int s = que.top();

             que.pop();

             ans[f--] = s;

             int len = vt[s].size();

             for(int i = ;i < len;++i)

             {

                 int tt = vt[s][i];

                 du[tt]--;

                 if(du[tt] == ) que.push(tt);

             }

         }

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

         printf(i == ? "%d":" %d",ans[i]);

         puts("");

     }

     return ;

 }