Problem: Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski tracks. All tracks go towards the foot of the mountain, so there are no directed cycles formed by the tracks. There are at most two tracks leaving each spot, but many tracks may enter the same spot.

A skier can start skiing from one spot and stop in another spot if there is a sequence of tracks that lead from the starting spot and end in the ending spot. Unfortunately, recently there were many accidents, because the structure of the resort allows a skier to go through dangerous paths, by reaching high speed and endangering himself and the other customers. Here, a path is called dangerous, if it consists of at least two tracks.

Arthur wants to secure his customers by closing some of the spots in a way that there are no dangerous paths in the resort. When a spot is closed, all tracks entering and leaving that spot become unusable. 

Formally, after closing some of the spots, there should not be a path that consists of two or more tracks.

Arthur doesn't want to close too many spots. He will be happy to find any way to close at most 4/7n spots so that the remaining part is safe. Help him find any suitable way to do so.

Input

The first line contains a single positive integer T — the number of test cases. T test case description follows.

The first line of each description contains two integers n and m (1 ≤ n ≤ 2 ⋅ 10^5) — the number of landing spots and tracks respectively.

The following m lines describe the tracks. Each of these lines contains two integers x and y (1 ≤ x < y ≤ n) — indices of the starting and finishing spots for the respective track. It is guaranteed that at most two tracks start at each spot. There may be tracks in which starting and finishing spots both coincide.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case, print a single integer k (0 ≤ k ≤ 4/7n) — the number of spots to be closed. In the next line, print k distinct integers — indices of all spots to be closed, in any order.

If there are several answers, you may output any of them. Note that you don't have to minimize k. It can be shown that a suitable answer always exists.

Example

Input


2
4 6
1 2
1 3
2 3
2 4
3 4
3 4
7 6
1 2
1 3
2 4
2 5
3 6
3 7


Output


2
3 4 
4
4 5 6 7 

Note

In the first sample case, closing any two spots is suitable.

In the second sample case, closing only the spot 1 is also suitable.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<long long int> prime, sfac;
vector<long long int> ps;
void sieve(long long int n) {
  prime.assign(n + 1, 1);
  sfac.assign(n + 1, 1);
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == 1) {
      sfac[p] = p;
      for (int i = p * p; i <= n; i += p) {
        prime[i] = 0;
        sfac[i] = p;
      }
    }
  }
  for (long long int i = 2; i <= n; i++) {
    if (prime[i]) ps.push_back(i);
  }
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    long long int k = y & 1LL;
    if (k) res = res * x;
    y = y >> 1LL;
    x = x * x;
  }
  return res;
}
int isPrime(long long int n) {
  if (n <= 1) return 0;
  if (n <= 3) return 1;
  if (n % 2 == 0 || n % 3 == 0) return 0;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 0;
  return 1;
}
void debug(long long int a[], long long int n) {
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
void input(long long int a[], long long int n) {
  for (int i = 0; i < n; i++) cin >> a[i];
}
void dfs1(int node, int visited[], vector<long long int> g[], int col[],
          int parent) {
  if (node == 1) {
    col[node] = 1;
  } else if (node != 1) {
    col[node] = (col[parent] + 1) % 2;
  }
  visited[node] = 1;
  for (auto i : g[node]) {
    if (!visited[i]) dfs1(i, visited, g, col, node);
  }
}
void dfs2(int node, int visited[], vector<long long int> g[], int col[],
          int parent) {
  if (node == 1) {
    col[node] = 0;
  } else if (node != 1) {
    col[node] = (col[parent] + 1) % 2;
  }
  visited[node] = 1;
  for (auto i : g[node]) {
    if (!visited[i]) dfs2(i, visited, g, col, node);
  }
}
int main() {
  long long int tt;
  cin >> tt;
  while (tt--) {
    long long int n, m;
    cin >> n >> m;
    vector<int> g[n + 1], p[n + 1];
    for (int i = 1; i <= m; i++) {
      int x, y;
      cin >> x >> y;
      g[x].push_back(y);
      p[y].push_back(x);
    }
    vector<long long int> fs, path;
    fs.assign(n + 1, -1);
    path.assign(n + 1, 0);
    fs[1] = 1;
    for (int i = 2; i <= n; i++) {
      if (p[i].empty()) {
        fs[i] = 1;
        continue;
      }
      for (auto j : p[i]) {
        if (fs[j] == 0) continue;
        if (fs[j] == 1 && path[j]) {
          fs[i] = 0;
          path[i] = 2;
          break;
        }
        path[i] = max(path[i], path[j] + 1);
      }
      if (fs[i] != 0) {
        fs[i] = 1;
        continue;
      }
    }
    int count = 0;
    string ans = "";
    for (int i = 1; i <= n; i++) {
      if (fs[i] == 0) {
        count++;
        ans += to_string(i) + " ";
      }
    }
    cout << count << endl;
    cout << ans << endl;
  }
}