#include <bits/stdc++.h>
#define rep(i,a,b) for (ll i = (a); i <= (b); ++i)
#define per(i,a,b) for (ll i = (b); i >= (a); --i)
#define all(x) begin(x),end(x)
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using ii = pair<ll,ll>;

ll k;
vi ans;

const ll N = 3e5+3, INF = 1e9+3;
ll n, a[N];

template <const ll N>
struct seg {
    ll n, mn[2*N], mx[2*N];
    void set(ll _n) {
        n = _n;
        fill(mn,mn+2*n,+INF);
        fill(mx,mx+2*n,-INF);
    }
    void update(ll k, ll x) {
        k+=n; mn[k] = mx[k] = x;
        for (; (k/=2) >= 1; k /= 2) {
            mn[k] = min(mn[2*k], mn[2*k+1]);
            mx[k] = max(mx[2*k], mx[2*k+1]);
        }
    }
    ii query(ll l, ll r) {
        ll mres = +INF, Mres = -INF;
        for (l+=n, r+=n; l<=r; ++l/=2, --r/=2) {
            if (l&1) {
                mres = min(mres, mn[l]);
                Mres = max(Mres, mx[l]);
            }
            if (~r&1) {
                mres = min(mres, mn[r]);
                Mres = max(Mres, mx[r]);
            }
        }
        return { mres, Mres };
    }
};

seg<N> ds;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> k;
    rep(tc,1,k) {
        cin >> n;
        vi vals;
        rep(i,1,n) cin >> a[i], vals.pb(a[i]);
        sort(all(vals)), vals.erase(unique(all(vals)),end(vals));
        
        ds.set(n+1);
        per(i,1,n) {
            ll j = lower_bound(all(vals), a[i]) - begin(vals);
            
            ds.update(j, i);
            ll mn = ds.query(0, j-1).first;
            ll mx = ds.query(j+1, n).second;
            
            if (mn == +INF) continue;
            if (mx == -INF) continue;
            if (mn < mx) {
                ans.push_back(tc);
                break;
            }
        }
    }
    cout << size(ans) << '\n';
    sort(all(ans));
    for (auto e : ans) {
        cout << e << '\n';
    }
}