#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<queue>

 #include<algorithm>

 #define mod=1e9+7;

 using namespace std;

 typedef long long LL;

 const int maxn=;

 int g[maxn][maxn],out[maxn],ans[maxn];

 int main(){

     int t,n,m,u,v,tmp,i,j;

     scanf("%d",&t);

     while(t--){

         memset(g,,sizeof(g));

         memset(out,,sizeof(out));

         cin>>n>>m;

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

             cin>>u>>v;

             if(!g[u][v]){

                 g[u][v]=;

                 out[u]++;

             }

         }

         priority_queue<int> q;

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

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

         }

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

             if(q.empty()) break;

             u=q.top();q.pop();//取出队列中编号最大的数

             ans[u]=i;//使得大的数尽量往后面放

             for(j=;j<=n;j++){

                 if(g[j][u]){

                     g[j][u]=;

                     out[j]--;

                     if(out[j]==) q.push(j);

                 }

             }

         }

         if(i) printf("-1\n");

         else{

             printf("%d",ans[]);

             for(i=;i<=n;i++) printf(" %d",ans[i]);

             printf("\n");

         }

     }

     return ;

 }