#define _CRT_SECURE_NO_WARNINGS

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define ll long long
#define ull unsigned long long
#define ld long double
#define sz(a) (int) a.size()

const int inf = (int)1e9;
const ll linf = (ll)2e18;

const ll mod = (ll)1e9 + 7ll;

void dfs(int v, vector<vector<int>>& graph, vector<bool>& used, vector<int>& top_sort) {
	used[v] = true;
	for (int u : graph[v]) {
		if (!used[u]) dfs(u, graph, used, top_sort);
	}
	top_sort.push_back(v);
}

void solve() {
	int n; cin >> n;
	vector<ll> c(n);
	vector<ll> t(n);

	vector<vector<int>> graph(n);
	vector<vector<ll>> z(n);
	for (int i = 0; i < n; ++i) cin >> c[i];
	for (int i = 0; i < n; ++i) cin >> t[i];

	for (int i = 0; i < n; ++i) {
		int m; cin >> m;
		for (int j = 0; j < m; ++j) {
			int v; cin >> v;
			graph[--v].push_back(i);
			z[i].push_back(v);
		}
	}

	vector<bool> used(n, false);
	vector<int> top_sort;

	for (int i = 0; i < n; ++i) {
		if (!used[i]) dfs(i, graph, used, top_sort);
	}

	reverse(top_sort.begin(), top_sort.end());

	vector<int> ans;

	pair<ll, ll> p = { 0, 1 };
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < sz(z[i]); ++j) {
			t[i] = max(t[i], t[z[i][j]]);
		}

		if (p.first * t[i] < p.second * c[i]) {
			p = { c[i], t[i] };
		}
	}

	for (int i = 0; i < n; ++i) {
		if (p.first * t[i] == p.second * c[i]) ans.push_back(i + 1);
	}
	for (auto el : ans) cout << el << "\n";
}
	

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	//freopen("test.in", "r", stdin);
	//freopen("test.in", "w", stdout);
	//cout << fixed << setprecision(7);

	//clock_t start = clock();

	int tet = 1;
	//cin >> tet;
	while (tet--) {
		solve();
	}

	//clock_t end = clock();
	//ld seconds = (ld)(end - start) / CLOCKS_PER_SEC;
	//cout << seconds << "\n";
}