#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H a, T... b) {
  cout << a << ' ';
  debug(b...);
}
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main() {
  FAST_IO(".inp", ".out");
  int testcases = 1;
  cin >> testcases;
  for (int test = 1; test <= testcases; test++) {
    Hollwo_Pelw();
  }
  return 0;
}
const int allmod[3] = {(int)1e9 + 7, 998244353, (int)1e9 + 9};
const int mod = allmod[1];
const int MAXN = 1e6 + 5;
const int inf = 2e9;
const long long linf = 1e18;
int n, a[MAXN], vis[MAXN];
vector<int> cir;
void dfs(int u) {
  if (cir.size()) return;
  vis[u] = 1;
  int v = a[u];
  if (vis[v]) {
    while (v != u) {
      cir.push_back(v);
      v = a[v];
    }
    cir.push_back(u);
    return;
  }
  dfs(v);
}
void Hollwo_Pelw() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i], a[i] = i - a[i], vis[i] = 0;
  }
  cir.clear();
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i);
  cout << cir.size() << "\n";
  for (auto v : cir) cout << v << ' ';
  cout << "\n";
}
