10 9 5
0 0 0 0 0 0 0 0 0 4
10 3
10 7
10 5
10 8
10 9
10 1
10 4
10 6
10 2
 10 20 5
2 2 1 4 0 3 0 4 1 3
6 1
8 5
2 10
3 5
1 9
4 6
9 7
2 3
7 4
10 8
4 9
2 5
4 10
2 8
10 3
1 8
8 10
6 7
5 1
10 3
 10 9 2
1 1 0 1 1 1 1 1 1 1
3 10
3 8
3 6
3 7
3 5
3 4
3 1
3 9
3 2
 10 10 5
3 4 2 0 3 0 1 1 2 4
8 9
7 3
5 2
4 8
3 5
6 8
3 5
1 10
10 6
9 1
 10 30 10
7 9 1 5 4 6 0 3 8 2
10 8
8 5
6 1
8 5
3 10
10 8
9 2
8 5
7 3
3 10
1 9
10 8
6 1
1 9
8 5
7 3
1 9
7 3
7 3
4 6
10 8
7 3
3 10
10 8
1 9
8 5
6 1
4 6
3 10
6 1
 6 7 3
0 1 2 0 1 2
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 10 9 2
0 1 0 0 1 0 1 1 1 1
3 7
3 2
8 6
1 7
3 9
5 4
10 1
4 9
6 2
 10 10 10
2 3 5 7 0 8 6 9 4 1
1 2
10 1
5 10
5 10
4 6
8 5
1 2
1 2
7 4
1 2
 10 9 5
1 1 1 1 1 2 1 1 1 1
6 7
6 3
6 5
6 4
6 9
6 8
6 1
6 10
6 2
 10 9 2
0 0 0 0 1 1 0 1 1 1
4 10
8 2
10 3
3 9
1 5
6 2
6 1
7 9
8 7
 5 5 3
2 2 0 1 0
5 4
5 2
1 4
5 1
4 3
 10 9 5
0 4 1 0 1 2 1 0 4 4
8 7
4 3
1 5
2 4
6 5
10 8
9 1
6 7
6 3
 7 8 3
0 0 1 2 2 0 1
1 5
4 3
7 5
1 7
3 2
2 4
6 7
6 5
 10 30 7
5 4 2 3 3 2 5 0 1 6
7 2
2 4
9 3
3 5
5 2
7 10
6 5
10 1
9 8
10 8
3 4
10 4
4 2
7 6
2 8
1 10
5 10
5 6
5 6
6 2
6 5
9 10
8 6
2 4
9 7
1 9
10 4
6 10
9 3
2 7
 5 5 3
1 1 2 0 0
1 3
1 5
2 3
3 4
2 4
 10 10 2
1 1 1 0 1 0 0 0 0 1
4 10
10 7
7 1
5 6
6 3
1 8
2 9
5 4
3 8
2 9
 9 13 3
0 2 1 2 2 0 1 0 1
4 7
9 5
7 5
7 6
9 6
8 2
3 2
8 3
4 3
4 9
1 2
1 3
5 6
 6 3 3
0 1 2 0 1 2
4 5
5 6
4 6
 10 10 5
3 3 3 4 4 1 3 0 2 4
7 5
10 8
10 8
5 8
2 10
9 2
7 4
3 4
7 5
4 8
 10 15 2
1 0 1 1 0 0 1 0 0 1
5 1
7 8
2 10
3 5
1 9
6 4
7 9
2 3
6 4
8 10
9 4
8 4
8 1
10 8
6 7
 2 1 2
1 0
1 2
 5 5 4
0 1 2 3 3
1 2
2 3
3 4
4 1
3 5
 10 9 5
2 1 2 0 1 0 1 2 0 4
10 9
3 7
1 5
10 6
7 9
10 4
5 4
2 6
8 2
 9 10 3
0 2 2 1 0 0 1 2 1
4 6
2 6
5 7
4 8
9 2
9 1
3 5
8 1
3 7
6 2
 10 20 3
2 2 1 1 2 0 0 1 2 2
7 5
7 10
2 7
10 4
10 8
1 7
3 7
9 7
3 10
6 3
4 1
4 1
8 6
3 7
10 3
2 7
8 5
2 7
1 4
2 6
 10 9 8
3 2 1 1 5 6 7 0 4 0
10 7
5 9
10 4
7 6
6 5
3 2
2 1
9 1
3 8

1
1 
 5
1 4 6 7 9 
 10
1 2 3 4 5 6 7 8 9 10 
 1
2 
 1
2 
 3
4 5 6 
 10
1 2 3 4 5 6 7 8 9 10 
 1
2 
 1
6 
 10
1 2 3 4 5 6 7 8 9 10 
 3
1 4 5 
 1
6 
 3
2 3 4 
 8
2 3 4 5 7 8 9 10 
 3
2 3 4 
 2
2 9 
 1
4 
 1
1 
 1
1 
 10
1 2 3 4 5 6 7 8 9 10 
 2
1 2 
 1
5 
 1
1 
 3
3 5 7 
 3
3 7 10 
 1
4 

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ld M_PI = acos(-1.0);
template <typename T>
inline void setmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
inline void setmin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T, typename S>
istream& operator>>(istream& in, pair<S, T>& p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T, typename S>
ostream& operator<<(ostream& out, pair<S, T>& p) {
  out << p.first << ' ' << p.second << ' ';
  return out;
}
template <typename T>
istream& operator>>(istream& in, vector<T>& v) {
  for (T& x : v) in >> x;
  return in;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (T& x : v) out << x << ' ';
  return out;
}
const ld eps = 1e-9;
const int INF = 2000000000;
const ll LINF = 1ll * INF * INF;
const ll MOD = 1000000007;
const int N = 1e5 + 10;
vector<int> e[N], er[N];
int tim = -1;
vector<int> order;
char used[N], here[N];
int comp[N];
void dfs1(int u) {
  used[u] = 1;
  for (int v : e[u])
    if (!used[v]) dfs1(v);
  order.emplace_back(u);
}
void dfs2(int u) {
  used[u] = 1;
  comp[u] = tim;
  for (int v : er[u])
    if (!used[v]) dfs2(v);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  srand((unsigned)chrono::high_resolution_clock::now()
            .time_since_epoch()
            .count());
  int n, m, h;
  cin >> n >> m >> h;
  vector<int> t(n);
  cin >> t;
  while (m--) {
    int c1, c2;
    cin >> c1 >> c2;
    --c1, --c2;
    for (int i = (int)(0); i < (int)(2); ++i) {
      if (t[c1] + 1 == t[c2] || (t[c1] == h - 1 && t[c2] == 0))
        e[c1].emplace_back(c2);
      swap(c1, c2);
    }
  }
  for (int u = (int)(n)-1; u >= (int)(0); --u)
    for (int v : e[u]) er[v].emplace_back(u);
  for (int u = (int)(0); u < (int)(n); ++u)
    if (!used[u]) dfs1(u);
  memset(used, 0, sizeof used);
  reverse((order).begin(), (order).end());
  for (int x : order)
    if (!used[x]) {
      ++tim;
      dfs2(x);
    }
  vector<int> sz(tim + 1), bad(tim + 1);
  for (int u = (int)(0); u < (int)(n); ++u) {
    ++sz[comp[u]];
    for (int v : e[u])
      if (comp[u] != comp[v]) bad[comp[u]] = 1;
  }
  int opt = 0;
  for (int i = (int)(0); i < (int)(tim + 1); ++i) {
    if (bad[i]) continue;
    if (bad[opt] || sz[i] > sz[opt]) opt = i;
  }
  cout << sz[opt] << '\n';
  for (int u = (int)(0); u < (int)(n); ++u)
    if (comp[u] == opt) cout << u + 1 << ' ';
  cout << '\n';
}
