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>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
struct rge {
  T b, e;
};
template <class T>
rge<T> range(T i, T j) {
  return rge<T>{i, j};
}
template <class T>
auto dud(T *x) -> decltype(cerr << *x, 0);
template <class T>
char dud(...);
struct debug {
  template <class T>
  debug &operator<<(const T &) {
    return *this;
  }
};
struct Dsu {
  vector<int> pr, tot;
  Dsu(int n = 0) : pr(n + 5), tot(n + 5, 1) { iota(begin(pr), end(pr), 0); }
  int find(int u) { return pr[u] == u ? u : pr[u] = find(pr[u]); }
  void unite(int u, int v) {
    u = find(u), v = find(v);
    if (u != v) pr[v] = u, tot[u] += tot[v];
  }
  bool same(int u, int v) { return find(u) == find(v); }
  int operator[](int u) { return find(u); }
} dsu;
const int N = 1e5 + 5, inf = 2e9;
vector<int> graph[N], dag[N];
int tin[N], fup[N];
bool still[N];
stack<int> stk;
int timer = 0;
void tarjan(int u) {
  tin[u] = fup[u] = ++timer;
  still[u] = true;
  stk.push(u);
  for (int v : graph[u]) {
    if (!tin[v]) tarjan(v);
    if (still[v]) fup[u] = min(fup[u], fup[v]);
  }
  if (fup[u] == tin[u]) {
    int v;
    do {
      v = stk.top();
      stk.pop();
      still[v] = false;
      dsu.unite(u, v);
    } while (v != u);
  }
}
int n, m, h, off[N], outdeg[N];
struct Edge {
  int u, v;
};
vector<Edge> edges;
void reset() {
  for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
       u += 1 - 2 * ((1) > (n + 1))) {
    graph[u].clear();
    tin[u] = fup[u] = still[u] = off[u] = outdeg[u] = 0;
  }
  timer = 0;
  stk = stack<int>();
  dsu = Dsu(n);
  edges.clear();
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  while (cin >> n >> m >> h) {
    reset();
    for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
         u += 1 - 2 * ((1) > (n + 1)))
      cin >> off[u];
    while (m--) {
      int u, v;
      cin >> u >> v;
      if ((off[u] + 1) % h == off[v])
        graph[u].push_back(v), edges.push_back({u, v});
      if ((off[v] + 1) % h == off[u])
        graph[v].push_back(u), edges.push_back({v, u});
    }
    for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
         u += 1 - 2 * ((1) > (n + 1)))
      if (!tin[u]) tarjan(u);
    for (auto e : edges) {
      int u = dsu[e.u], v = dsu[e.v];
      if (!dsu.same(u, v)) dag[u].push_back(v), outdeg[u]++;
    }
    debug() << " "
            << "range(outdeg + 1, outdeg + n + 1)"
               ": "
            << (range(outdeg + 1, outdeg + n + 1)) << " ";
    for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
         u += 1 - 2 * ((1) > (n + 1)))
      debug() << " "
              << "dag[u]"
                 ": "
              << (dag[u]) << " ";
    int mn = inf, id;
    for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
         u += 1 - 2 * ((1) > (n + 1)))
      if (u == dsu[u])
        if (dsu.tot[u] < mn && !outdeg[u]) mn = dsu.tot[u], id = u;
    cout << mn << '\n';
    for (auto u = (1) - ((1) > (n + 1)); u != n + 1 - ((1) > (n + 1));
         u += 1 - 2 * ((1) > (n + 1)))
      if (dsu[u] == id) cout << u << " ";
    cout << '\n';
  }
  return 0;
}
