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;
template <class TCost>
class Graph {
 public:
  struct Edge {
    long from, to;
    TCost cost;
    Edge(long _from, long _to, TCost _cost)
        : from(_from), to(_to), cost(_cost){};
  };
  long size;
  bool zeroIndexed;
  vector<Edge> edges;
  vector<vector<pair<long, TCost>>> adjacencyList;
  Graph(){};
  Graph(long _size, bool _zeroIndexed = true) {
    zeroIndexed = _zeroIndexed;
    if (!zeroIndexed) _size++;
    size = _size;
    adjacencyList.resize(_size);
  };
  ~Graph() = default;
};
template <class TCost>
class DirectedGraph : public Graph<TCost> {
 public:
  DirectedGraph(){};
  DirectedGraph(long _size, bool _zeroIndexed)
      : Graph<TCost>(_size, _zeroIndexed){};
  DirectedGraph(long _size) : Graph<TCost>(_size){};
  void addEdge(long from, long to, TCost cost = 0) {
    this->edges.push_back({from, to, cost});
    this->adjacencyList[from].push_back({to, cost});
  }
  void printEdges() {
    for (auto edge : this->edges) {
      cout << edge.from << ' ' << edge.to << endl;
    }
  }
};
template <class TCost>
class SCC {
 public:
  static void TarjanRecursion(long v, long &indexCount, vector<long> &index,
                              vector<long> &low, stack<long> &S,
                              DirectedGraph<TCost> &graph,
                              vector<bool> &onStack,
                              vector<vector<long>> &components) {
    index[v] = indexCount;
    low[v] = indexCount;
    indexCount++;
    S.push(v);
    onStack[v] = true;
    for (auto edge : graph.adjacencyList[v]) {
      long w = edge.first;
      if (!index[w]) {
        TarjanRecursion(w, indexCount, index, low, S, graph, onStack,
                        components);
        low[v] = min(low[v], low[w]);
      } else if (onStack[w]) {
        low[v] = min(low[v], index[w]);
      }
    }
    if (low[v] == index[v]) {
      vector<long> component;
      long w;
      do {
        w = S.top();
        S.pop();
        onStack[w] = false;
        component.push_back(w);
      } while (w != v);
      components.push_back(component);
    }
  }
  static vector<vector<long>> Tarjan(DirectedGraph<TCost> graph) {
    long indexCount = 1;
    vector<long> index(graph.size), low(graph.size);
    vector<bool> onStack(graph.size);
    stack<long> S;
    vector<vector<long>> components;
    for (long i = (graph.zeroIndexed ? 0 : 1); i < graph.size; i++) {
      if (!index[i]) {
        TarjanRecursion(i, indexCount, index, low, S, graph, onStack,
                        components);
      }
    }
    return components;
  }
};
long long n, m, h, u[100001], out[100001], sccnr[1000001], discard[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cout.precision(30);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> m >> h;
  for (__typeof(n + 1) i = (1) - ((1) > (n + 1));
       i != (n + 1) - ((1) > (n + 1)); i += 1 - 2 * ((1) > (n + 1)))
    cin >> u[i];
  DirectedGraph<long long> g(n, false);
  for (__typeof(m) i = (0) - ((0) > (m)); i != (m) - ((0) > (m));
       i += 1 - 2 * ((0) > (m))) {
    long long c1, c2;
    cin >> c1 >> c2;
    if ((u[c1] + 1) % h == u[c2]) g.addEdge(c1, c2), out[c1]++;
    if ((u[c2] + 1) % h == u[c1]) g.addEdge(c2, c1), out[c2]++;
  }
  vector<vector<long>> rs = SCC<long long>::Tarjan(g);
  for (__typeof(rs.size()) i = (0) - ((0) > (rs.size()));
       i != (rs.size()) - ((0) > (rs.size()));
       i += 1 - 2 * ((0) > (rs.size()))) {
    for (auto x : rs[i]) {
      sccnr[x] = i;
    }
  }
  for (auto edge : g.edges) {
    if (sccnr[edge.from] != sccnr[edge.to]) {
      discard[sccnr[edge.from]] = 1;
    }
  }
  long long best = INT32_MAX;
  for (__typeof(rs.size()) i = (0) - ((0) > (rs.size()));
       i != (rs.size()) - ((0) > (rs.size())); i += 1 - 2 * ((0) > (rs.size())))
    if (!discard[i] && rs[i].size() < best) best = (long long)rs[i].size();
  cout << best << endl;
  for (auto x : rs) {
    if (x.size() == best) {
      for (auto y : x) cout << y << ' ';
      return 0;
    }
  }
  return 0;
}
