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 ll = long long;
using ii = pair<int, int>;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
int n, m, h, nn;
vector<int> c[MAXN], u(MAXN);
vector<vector<int>> scc, e, r;
vector<set<int>> v, av;
int d[MAXN];
int go(int first, bool print = false) {
  int& ret = d[first];
  if (~ret) return ret;
  ret = int(scc[first - 1].size());
  if (print) {
    for (auto& second : scc[first - 1]) printf("%d ", second);
  }
  for (auto& second : v[first]) ret += go(second, print);
  return ret;
}
using Graph = vector<vector<int>>;
int SCC(Graph& edge, Graph& redge, Graph& result) {
  result.clear();
  int n = edge.size() - 1;
  vector<int> vis_i(n + 1, -1);
  stack<int> rev;
  for (int i = 1; i <= n; i++) {
    if (vis_i[i] != -1) continue;
    stack<int> s;
    s.push(i);
    while (!s.empty()) {
      int u, i;
      u = s.top();
      i = vis_i[u];
      for (++i; i < edge[u].size(); i++) {
        int v = edge[u][i];
        if (vis_i[v] == -1) {
          s.push(v);
          break;
        }
      }
      vis_i[u] = i;
      if (i == edge[u].size()) {
        rev.push(u);
        s.pop();
      }
    }
  }
  while (!rev.empty()) {
    int i = rev.top();
    rev.pop();
    if (vis_i[i] == -2) continue;
    result.push_back(vector<int>());
    stack<int> s;
    s.push(i);
    while (!s.empty()) {
      int u = s.top();
      s.pop();
      if (vis_i[u] == -2) continue;
      vis_i[u] = -2;
      for (auto& v : redge[u]) {
        if (vis_i[v] != -2) s.push(v);
      }
      result.back().emplace_back(u);
    }
  }
  return result.size();
}
int main() {
  scanf("%d%d%d", &n, &m, &h);
  e.resize(n + 1);
  r.resize(n + 1);
  for (int i = 1; i <= n; i++) scanf("%d", &u[i]);
  for (int i = 0; i < m; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    c[first].emplace_back(second);
    c[second].emplace_back(first);
  }
  for (int i = 1; i <= n; i++) {
    int nh = (u[i] + 1) % h;
    for (auto& j : c[i])
      if (nh == u[j] && i != j) e[i].emplace_back(j), r[j].emplace_back(i);
  }
  nn = SCC(e, r, scc);
  v.resize(nn + 1);
  vector<int> lab(n + 1);
  {
    int ptr = 0;
    for (auto& xx : scc) {
      for (auto& p : xx) lab[p] = ptr;
      ++ptr;
    }
  }
  vector<bool> dirty(n + 1);
  {
    for (auto& p : scc) {
      for (auto& q : p)
        for (auto& r : e[q])
          if (lab[r] != lab[q]) dirty[lab[q]] = true, v[lab[q]].emplace(lab[r]);
    }
  }
  int ans = 0;
  {
    int i = -1, j = 0;
    for (auto& p : scc) {
      if (!dirty[j] & (i < 0 || p.size() < scc[i].size())) i = j;
      ++j;
    }
    ans = i;
  }
  printf("%d\n", (int)scc[ans].size());
  for (auto& p : scc[ans]) printf("%d ", p);
  puts("");
  return 0;
}
