#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;

int n;
vector<ll> profit;
vector<ll> ptime;
vector<vector<int>> g;

vector<ll> actTime;
vector<int> ans;

pair<ll, ll> mxRat = { 0, 1 };

bool lt(pair<ll, ll> a, pair<ll, ll> b) {
	return a.first * b.second < b.first * a.second;
}

bool eq(pair<ll, ll> a, pair<ll, ll> b) {
	return a.first * b.second == b.first * a.second;
}

void dfs(int v) {
	ll mxTime = ptime[v];
	for (int u : g[v]) {
		if (actTime[u] == -1) {
			dfs(u);
			mxTime = max(mxTime, actTime[u]);
		}
	}

	actTime[v] = mxTime;
	if (lt(mxRat, { profit[v], actTime[v] }))
		mxRat = { profit[v], actTime[v] };

	//cout << "v, act: " << v << ' ' << actTime[v] << endl;
}

int main() {
	cin >> n;
	profit.resize(n + 1);
	ptime.resize(n + 1);
	g.resize(n + 1);
	actTime.resize(n + 1, -1);

	vector<int> inCnt(n + 1);

	for (int i = 1; i <= n; ++i)
		cin >> profit[i];
	for (int i = 1; i <= n; ++i)
		cin >> ptime[i];

	for (int i = 1; i <= n; ++i) {
		int m;
		cin >> m;
		for (int j = 0; j < m; ++j) {
			int x;
			cin >> x;
			++inCnt[x];
			g[i].push_back(x);
		}
	}

	for (int v = 1; v <= n; ++v) {
		if (actTime[v] == -1 && inCnt[v] == 0)
			dfs(v);
	}

	for (int v = 1; v <= n; ++v) {
		if (eq({profit[v], actTime[v]}, mxRat))
			cout << v << '\n';
	}

	return 0;
}