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;
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B>
inline void chmin(A& a, B b) {
  if (a > b) a = b;
}
template <typename A, typename B>
inline void chmax(A& a, B b) {
  if (a < b) a = b;
}
const int32 DIRECTED = 0;
const int32 UNDIRECTED = 1;
template <int32 isUNDIRECTED = 0>
class Graph {
  struct Edge {
    int32 u, v, id;
    int64 c;
    Edge(int32 u, int32 v, int64 c = 0, int32 id = 0)
        : u(u), v(v), c(c), id(id) {}
  };
  int32 V, E;
  vector<vector<Edge>> G;
  vector<Edge> Es;

 public:
  Graph() {}
  Graph(int32 V) : V(V) { G.resize(V); }
  Graph(const Graph<isUNDIRECTED>& g) : V(g.V), E(g.E), G(g.G), Es(g.Es) {}
  void add_edge(int32 u, int32 v, int64 c = 0, int32 id = 0) {
    G[u].emplace_back(u, v, c, id);
    if (isUNDIRECTED) G[v].emplace_back(v, u, c, id);
    Es.emplace_back(u, v, c, id);
    E++;
  }
  const vector<Edge>& operator[](int32 k) { return G[k]; }
};
class SCC {
 private:
  Graph<DIRECTED> orgG, revG, newG;
  vector<int32> ord, comp;
  vector<bool> used;
  vector<vector<int32>> vs;
  int32 V, nV;

 public:
  SCC() {}
  SCC(int32 V) : orgG(V), revG(V), comp(V, -1), used(V, 0), V(V) {}
  void add_edge(int32 u, int32 v) {
    orgG.add_edge(u, v);
    revG.add_edge(v, u);
  }
  void dfs(int32 v) {
    used[v] = true;
    for (auto e : orgG[v]) {
      if (!used[e.v]) dfs(e.v);
    }
    ord.push_back(v);
  }
  void rdfs(int32 v, int32 k) {
    used[v] = true;
    comp[v] = k;
    for (auto e : revG[v]) {
      if (!used[e.v]) rdfs(e.v, k);
    }
  }
  int32 build() {
    for (int32 i = 0; i < V; i++) {
      if (!used[i]) dfs(i);
    }
    fill(used.begin(), used.end(), 0);
    int32 k = 0;
    for (int32 i = ord.size() - 1; i >= 0; i--) {
      if (!used[ord[i]]) rdfs(ord[i], k++);
    }
    nV = k;
    vs.resize(k, vector<int32>());
    for (int32 i = 0; i < V; i++) vs[comp[i]].push_back(i);
    newG = Graph<DIRECTED>(k);
    for (int32 i = 0; i < V; i++) {
      for (auto e : orgG[i]) {
        if (comp[i] != comp[e.v]) newG.add_edge(comp[i], comp[e.v], e.c);
      }
    }
    return k;
  }
  int32 size() { return nV; }
  const Graph<DIRECTED>& graph() { return newG; }
  const vector<int32>& vertices(int32 v) { return vs[v]; }
  int32 operator[](int32 k) { return comp[k]; }
};
SCC scc;
int32 n, m, h;
int32 u[112345];
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> h;
  for (int i = 0; i < (n); i++) cin >> u[i];
  scc = SCC(2 * n);
  for (int i = 0; i < (n); i++) {
    scc.add_edge(i, i + n);
  }
  for (int i = 0; i < (m); i++) {
    int32 a, b;
    cin >> a >> b;
    a--;
    b--;
    if ((u[a] + 1) % h == u[b]) scc.add_edge(a + n, b);
    if ((u[b] + 1) % h == u[a]) scc.add_edge(b + n, a);
  }
  scc.build();
  Graph<DIRECTED> G = scc.graph();
  vector<bool> visited(scc.size(), 0);
  vector<int32> dp(scc.size(), -1);
  int32 res_s = (int)1e9;
  vector<int32> res;
  function<void(int32)> dfs = [&](int32 v) {
    if (G[v].size() == 0) {
      vector<int32> a = scc.vertices(v);
      if (res_s > a.size()) {
        res_s = a.size();
        res = a;
      }
      return;
    }
    for (auto e : G[v]) {
      if (!visited[e.v]) {
        visited[e.v] = 1;
        dfs(e.v);
      }
    }
  };
  for (int i = 0; i < (scc.size()); i++) {
    if (!visited[i]) {
      dfs(i);
    }
  }
  cout << (res.size() + res.size() % 2) / 2 << endl;
  for (int i = 0; i < (res.size()); i++) {
    if (res[i] >= n) cout << res[i] - n + 1 << " ";
  }
  cout << endl;
}
