Problem: James Bond has a new plan for catching his enemy. There are some cities and directed roads between them, such that it is possible to travel between any two cities using these roads. When the enemy appears in some city, Bond knows her next destination but has no idea which path she will choose to move there. 

The city a is called interesting, if for each city b, there is exactly one simple path from a to b. By a simple path, we understand a sequence of distinct cities, such that for every two neighboring cities, there exists a directed road from the first to the second city. 

Bond's enemy is the mistress of escapes, so only the chase started in an interesting city gives the possibility of catching her. James wants to arrange his people in such cities. However, if there are not enough interesting cities, the whole action doesn't make sense since Bond's people may wait too long for the enemy.

You are responsible for finding all the interesting cities or saying that there is not enough of them. By not enough, James means strictly less than 20\% of all cities. 

Input

The first line contains one integer t (1 ≤ t ≤ 2 000) — the number of test cases. Each test case is described as follows:

The first line contains two integers n and m (1 ≤ n ≤ 10^5, 0 ≤ m ≤ 2 ⋅ 10^5) — the number of cities and roads between them. Each of the following m lines contains two integers u, v (u ≠ v; 1 ≤ u, v ≤ n), which denote that there is a directed road from u to v.

You can assume that between each ordered pair of cities there is at most one road. The sum of n over all test cases doesn't exceed 10^5, and the sum of m doesn't exceed 2 ⋅ 10^5.

Output

If strictly less than 20\% of all cities are interesting, print -1. Otherwise, let k be the number of interesting cities. Print k distinct integers in increasing order — the indices of interesting cities.

Example

Input


4
3 3
1 2
2 3
3 1
3 6
1 2
2 1
2 3
3 2
1 3
3 1
7 10
1 2
2 3
3 1
1 4
4 5
5 1
4 6
6 7
7 4
6 1
6 8
1 2
2 3
3 4
4 5
5 6
6 1
6 2
5 1


Output


1 2 3 
-1
1 2 3 5 
-1

Note

In all drawings, if a city is colored green, then it is interesting; otherwise, it is colored red.

In the first sample, each city is interesting. 

<image>

In the second sample, no city is interesting. 

<image>

In the third sample, cities 1, 2, 3 and 5 are interesting. 

<image>

In the last sample, only the city 1 is interesting. It is strictly less than 20\% of all cities, so the answer is -1. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
int n, m, kase, u, v;
struct Edge {
  int to, from, nex;
} edge[maxn << 1];
int head[maxn], ecnt;
void add_edge(int u, int v) {
  edge[++ecnt] = {v, u, head[u]};
  head[u] = ecnt;
}
mt19937 mt(time(0));
set<int> se;
int rk[maxn], tot, p[maxn], rt;
bool vis[maxn];
bool dfs(int u) {
  vis[u] = true;
  rk[++tot] = u;
  for (int i = head[u]; i; i = edge[i].nex) {
    int v = edge[i].to;
    if (!p[v]) {
      p[v] = u;
      if (!dfs(v)) return false;
    } else if (!vis[v])
      return false;
  }
  return vis[u] = false, true;
}
bool check(int u) {
  memset(p, 0, n + 2 << 2);
  p[u] = -1;
  tot = 0;
  if (!dfs(u)) return false;
  int i = 1;
  for (; i <= n && p[i]; ++i)
    ;
  return i > n;
}
int cov[maxn], Cov[maxn], ok[maxn];
int main() {
  scanf("%d", &kase);
  while (kase--) {
    scanf("%d %d", &n, &m);
    memset(head, 0, n + 2 << 2);
    ecnt = 0;
    for (int i = 1; i <= m; i++) {
      scanf("%d %d", &u, &v);
      add_edge(u, v);
    }
    int T = min(60, n);
    se.clear();
    for (int i = 1; i <= T; i++) {
      int rd = mt() % n + 1;
      if (se.find(rd) != se.end()) i--;
      se.insert(rd);
    }
    rt = 0;
    for (auto it : se)
      if (check(it)) {
        rt = it;
        break;
      }
    memset(cov, 0, n + 2 << 2);
    memset(Cov, 0, n + 2 << 2);
    memset(ok, 0, n + 2 << 2);
    if (!rt) {
      puts("-1");
      continue;
    }
    for (int i = 1; i <= m; i++)
      if (u = edge[i].from, v = edge[i].to, p[v] != u)
        ++cov[u], --cov[v], Cov[u] ^= i, Cov[v] ^= i;
    for (int i = n; i; i--) v = rk[i], cov[p[v]] += cov[v], Cov[p[v]] ^= Cov[v];
    for (int i = 1; i <= n; i++)
      v = rk[i], ok[v] = i == 1 || (cov[v] == 1 && ok[edge[Cov[v]].to]);
    vector<int> ans;
    for (int i = 1; i <= n; i++)
      if (ok[i]) ans.push_back(i);
    if (ans.size() * 5 < n)
      printf("-1");
    else
      for (auto it : ans) printf("%d ", it);
    puts("");
  }
  return 0;
}