#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (auto i=(a); i<(b); ++i)
#define iter(it,c) for (auto it = (c).begin(); it != (c).end(); ++it)
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
const int INF = 2147483647;

int main() {
    int ts;
    cin >> ts;

    vi found;
    rep(t,0,ts) {
        int n;
        cin >> n;

        vi arr(n);
        rep(i,0,n) {
            cin >> arr[i];
            arr[i] = -arr[i];
        }

        stack<int> S;
        vi outp;
        rep(i,0,n) {
            while (!S.empty() && arr[i] > S.top()) {
                outp.push_back(S.top());
                S.pop();
            }
            S.push(arr[i]);
        }
        while (!S.empty()) {
            outp.push_back(S.top());
            S.pop();
        }

        bool ok = true;
        rep(i,1,outp.size()) {
            if (outp[i-1] > outp[i]) {
                ok = false;
                break;
            }
        }

        if (!ok) {
            found.push_back(t);
        }
    }

    cout << found.size() << endl;
    iter(it,found) {
        cout << *it+1 << endl;
    }

    return 0;
}