#!/usr/bin/env python3

def solve():
    n = int(input())
    a = list(map(int, input().split()))
    idx = list(range(n))
    idx.sort(key=lambda i: a[i], reverse=True)

    ft = [0]*(n+1)
    right = -1
    for i in idx:
        x = a[i]
        j = i+1
        while j <= n:
            ft[j] = max(ft[j], right)
            j += j&-j
        right = max(right, i)
        s = 0
        j = i
        while j > 0:
            s = max(s, ft[j])
            j -= j&-j
        if s > i:
            return True
            break
    return False


t = int(input())
l = []
for i in range(1, t+1):
    if solve(): l.append(i)
print(len(l))
print(*l,sep='\n')