1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <queue>
 5 #define NUM 202
 6 #define MAX 40002
 7 using namespace std;
 8
 9 int n,m;
10
11 int e[NUM][NUM];
12 int tot[NUM];
13 int lo[NUM];
14
15 priority_queue<int,vector<int>,less<int> > p;
16 bool tp(){
17     int c=n;
18     int r=0;
19     while(!p.empty()) p.pop();
20     for(int i=1;i<=n;i++) if(tot[i]==0) p.push(i);
21     while(!p.empty()){
22         int v=p.top();
23         lo[v]=c; c--;
24         r++;
25         p.pop();
26         for(int i=1;i<=n;i++){
27             if(e[v][i]==1){
28                 tot[i]--;
29                 if(tot[i]==0){
30                     p.push(i);
31                 }
32             }
33         }
34     }
35     if(r<n) return 0;
36     return 1;
37 }
38
39 int main()
40 {
41     int t,u,v;
42     bool f;
43     //freopen("data.txt","r",stdin);
44     scanf("%d",&t);
45     for(int z=0;z<t;z++){
46         scanf("%d %d",&n,&m);
47         memset(e,0,sizeof(e));
48         memset(tot,0,sizeof(tot));
49         memset(lo,0,sizeof(lo));
50         f=0;
51         while(m--){
52             scanf("%d %d",&u,&v);
53             if(e[v][u]==0){
54                 if(u==v) f=1;
55                 e[v][u]=1;
56                 tot[u]++;
57             }
58         }
59         if(f || !tp()) printf("-1");
60         else{
61             for(int i=1;i<=n;i++){
62                 if(i!=1) printf(" ");
63                 printf("%d",lo[i]);
64             }
65         }
66         printf("\n\n");
67     }
68     return 0;
69 }