#pragma GCC optimize("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops") #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vld; typedef pair Pll; typedef pair Pin; ll INF = 1e16; int inf = 1e9; #define ALL(x) (x).begin(), (x).end() #define FOR(i, m, n) for (ll i = (m); i < (n); ++i) #define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i) #define REP(i, n) FOR(i, 0, n) #define REVREP(i, n) REVFOR(i, 0, n) #define fi first #define se second #define pb push_back #define mp make_pair #define eb emplace_back #define bcnt __builtin_popcountll #ifdef LOCAL #include #define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__); #else #define debug(...) 83; #endif void d_err() { cerr << endl; } template void d_err(H h, T... t) { cerr << h << " "; d_err(t...); } template void print(T x) { cout << x << "\n"; } template void print(vector& x) { int N = x.size(); REP(i, N) { if (i > 0) cout << " "; cout << x[i]; } cout << "\n"; } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); int n, m; cin >> n >> m; vll a(n); REP(i, n) cin >> a[i]; vector edge(n); REP(i, m) { int u, v; cin >> u >> v; u--, v--; edge[u].eb(v); edge[v].eb(u); } vector s(n, false); int q; cin >> q; REP(i, q) { int b; cin >> b; s[b - 1] = true; } vector> aa; REP(i, n) aa.eb(a[i], i); sort(ALL(aa)); vi ans; REP(i, aa.size()) { auto [v, j] = aa[i]; if (s[j]) { ans.eb(j + 1); s[j] = false; for (auto &e: edge[j]) { if (a[e] > v) s[e] = s[e] ^ true; } } } print(ans.size()); for(auto &e: ans) print(e); }