#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0 ; i < n; ++i) {
    cin >> p[i];
    --p[i];
  }
  vector<int> used(n);
  for (int v = 0; !used[v]; v = p[v]) used[v] = true;
  vector<int> comp;
  for (int v = 0; v < n; ++v) {
    if (used[v]) {
      comp.push_back(v);
    }
  }
  if (comp.size() != 0 && comp.size() < n) {
    cout << n << "\n";
    cout << comp.size() << "\n";
    for (int i : comp) {
      cout << i + 1 << " ";
    }
    cout << "\n";
    return;
  }
  if (n == 2) {
    cout << "0\n1\n1\n";
    return;
  }
  comp.clear();
  for (int i = 1; i != 0 && i != 2; i = p[i]) comp.push_back(i);
  cout << n - 2 << "\n";
  cout << comp.size() << "\n";
  for (int i : comp) {
    cout << i + 1 << " ";
  }
  cout << "\n";
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  int tst;
  cin >> tst;
  while (tst--) {
    solve();
  }

  
  return 0;
}