#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define X first
#define Y second


const ll mod = 1000000007;
//const ll mod = 998244353;



ll pew(ll a, ll b) {
    ll res = 1;
    while (b>0) {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
    return res;
}



void solve() {
    ll T;
    cin >> T;
    vector<ll> A;
    for (ll t=1;t<=T;t++) {
        ll n;
        cin >> n;
        vector<ll> a(n);
        for (ll i=0;i<n;i++) cin >> a[i];
        vector<ll> mx(n+1);
        for (ll i=n-1;i>=0;i--) mx[i] = max(mx[i+1],a[i]);
        set<ll> kek;
        int ok = 0;
        for (ll i=0;i<n;i++) {
            auto it = kek.lower_bound(a[i]+1);
            if (it!=kek.end() and *it<mx[i+1]) {
                ok = 1;
                break;
            }
            kek.insert(a[i]);
        }
        if (ok==1) A.push_back(t);
    }
    cout << A.size() << "\n";
    for (ll x: A) cout << x << " ";
}

int main() {
    ios_base::sync_with_stdio(false);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}