#!/usr/bin/env python2
import sys

MAXN = 3*10**5
st = [0] * (4*MAXN)

def build(at, l, r):
    st[at] = 0

    if l < r:
        m = (l+r)//2
        build(2*at+1, l, m)
        build(2*at+2, m+1, r)

def update(at, l, r, i, v):
    if i < l or i > r:
        return

    st[at] += v

    if l < r:
        m = (l+r)//2
        update(2*at+1, l, m, i, v)
        update(2*at+2, m+1, r, i, v)

def query(at, l, r, ql, qr):
    if r < ql or qr < l:
        return 0
    if ql <= l and r <= qr:
        return st[at]

    m = (l+r)//2
    return query(2*at+1, l, m, ql, qr) + query(2*at+2, m+1, r, ql, qr)

ts = int(sys.stdin.readline())
found = []
for t in range(ts):
    n = int(sys.stdin.readline())

    # 2 1 3

    inp = sorted([ (v,i) for (i,v) in enumerate(map(int, sys.stdin.readline().split())) ])
    perm = [0]*n
    for i, (v,j) in enumerate(sorted(inp)):
        perm[j] = i

    build(0, 0, n-1)

    mx = -1
    for v in perm[::-1]:
        mx = max(mx, v)
        update(0, 0, n-1, v, 1)
        if v < mx and query(0, 0, n-1, v, mx) < mx-v+1:
            found.append(t)
            break

sys.stdout.write('%d\n' % len(found))
for v in found:
    sys.stdout.write('%d\n' % (v+1))