#include <bits/stdc++.h>
#define ll long long
#define cheat ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define cyes cout<<"Yes"<<endl
#define cno cout<<"No"<<endl
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fe first
#define se second


using namespace std;


const ll inf = 1e18;

struct detail {
    ll cost, time;
    int id;
};

bool cmp(const detail &a, const detail &b) {
    if(a.cost * b.time == a.time * b.cost) {
        return a.id < b.id;
    }
    return a.cost * b.time > a.time * b.cost;
}


int main(){
    int n;
    cin >> n;
    vector <ll> cost(n);
    vector <ll> time(n);
    for(ll&x : cost) {
        cin >> x;
    }
    for(ll&x: time) {
        cin >> x;
    }
    set <pair <ll, int>> st;
    vector <ll> dist = time; //max_time
    vector <vector <int>> gr(n);
    vector <vector <int>> par(n);
    for(int u = 0; u < n; u++) {
        int k;
        cin >> k;
        if(k == 0) {
            st.insert({time[u], u});
            dist[u] = time[u];
        } else {
            for(int i = 0; i < k; i++) {
                int to;
                cin >> to;
                to--;
                gr[u].push_back({to});
                par[to].push_back(u);
            }
        }
    }

    while(!st.empty()) {
        auto e = *st.begin();
        st.erase(e);
        int v = e.second;
        for(int to: par[v]) {
            if(dist[v] > dist[to]) {
                st.erase({dist[to], to});
                dist[to] = dist[v];
                st.insert({dist[to], to});
            }
        }
    }


    vector <detail> rat(n);
    for(int i = 0; i < n; i++) {
        rat[i] = {cost[i], dist[i], i};
    }
    sort(rat.begin(), rat.end(), cmp);
    /*for(auto a: rat) {
        cout << a.cost << ' ' << a.time << ' ' << a.id << endl;
    }
    cout << endl; */
    cout << rat[0].id + 1 << '\n';
    for(int i = 1; i < n; i++) {
        if(rat[i - 1].cost * rat[i].time != rat[i - 1].time * rat[i].cost) {
            break;
        }
        cout << rat[i].id + 1 << '\n';
    }
}