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;
const int MAXN = 101010, MAXM = 202020;
int n, m, h, u[MAXN], c[MAXN][2];
class Edge {
 public:
  int to, next;
} e[MAXM], e2[MAXM];
int head[MAXN], en = 0, head2[MAXN], en2 = 0;
void insert(int u, int v) {
  e[++en].to = v;
  e[en].next = head[u];
  head[u] = en;
}
void insert2(int u, int v) {
  e2[++en2].to = v;
  e2[en2].next = head2[u];
  head2[u] = en2;
}
int dfn[MAXN], low[MAXN], dfsnum = 0;
stack<int> st;
int block[MAXN], bls[MAXN], bln = 0;
int ansblk = 0, ans;
bool instack[MAXN];
void tarjan(int p) {
  dfn[p] = low[p] = ++dfsnum;
  st.push(p);
  instack[p] = true;
  for (int i = head[p]; i > 0; i = e[i].next) {
    if (!dfn[e[i].to]) tarjan(e[i].to);
    if (low[e[i].to] < low[p] && instack[e[i].to]) low[p] = low[e[i].to];
  }
  if (low[p] == dfn[p]) {
    bln++;
    bls[bln] = 0;
    while (st.top() != p) {
      block[st.top()] = bln;
      instack[st.top()] = false;
      bls[bln]++;
      st.pop();
    }
    block[p] = bln;
    instack[p] = false;
    bls[bln]++;
    st.pop();
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &h);
  for (int i = 1; i <= n; i++) scanf("%d", &u[i]);
  memset(head, -1, sizeof(head));
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &c[i][0], &c[i][1]);
    if ((u[c[i][0]] + 1) % h == u[c[i][1]]) insert(c[i][0], c[i][1]);
    if ((u[c[i][1]] + 1) % h == u[c[i][0]]) insert(c[i][1], c[i][0]);
  }
  memset(instack, false, sizeof(instack));
  memset(dfn, 0, sizeof(dfn));
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i);
  memset(head2, -1, sizeof(head2));
  for (int i = 1; i <= n; i++)
    for (int j = head[i]; j > 0; j = e[j].next)
      if (block[i] != block[e[j].to]) insert2(block[i], block[e[j].to]);
  ans = n + 1;
  for (int i = 1; i <= bln; i++)
    if (head2[i] == -1) {
      if (bls[i] < ans) {
        ans = bls[i];
        ansblk = i;
      }
    }
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++)
    if (block[i] == ansblk) printf("%d ", i);
  return 0;
}
