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>
int n, m, h, t[100010], f[100010], sz, first[100010], nxt[200010], tail[200010],
    cnt, l, sz2, f2[100010], n2[200010], t2[200010], scc[100010], s[100010],
    stk[100010], dfn[100010], low[100010], chosen[100010];
void addedge(int u, int v) {
  tail[++sz] = v;
  nxt[sz] = first[u];
  first[u] = sz;
}
void addedge2(int u, int v) {
  t2[++sz2] = v;
  n2[sz2] = f2[u];
  f2[u] = sz2;
}
void dfs(int u) {
  scc[u] = -1;
  low[u] = dfn[u] = ++dfn[0];
  stk[++l] = u;
  int v, e;
  for (e = first[u]; e; e = nxt[e]) {
    v = tail[e];
    if (scc[v] > 0) continue;
    if (!scc[v]) dfs(v);
    low[u] = std::min(low[u], low[v]);
  }
  if (low[u] == dfn[u]) {
    s[++cnt] = 0;
    while (stk[l] != u) {
      scc[stk[l--]] = cnt;
      s[cnt]++;
    }
    scc[stk[l--]] = cnt;
    s[cnt]++;
  }
}
void scc_dec() {
  memset(scc, 0, sizeof(scc));
  int i;
  for (cnt = 0, l = 0, i = 1; i <= n; i++)
    if (!scc[i]) dfs(i);
  memset(f2, 0, sizeof(f2));
  int u, e;
  for (sz2 = 0, u = 1; u <= n; u++)
    for (e = first[u]; e; e = nxt[e])
      if (scc[u] != scc[tail[e]]) addedge2(scc[u], scc[tail[e]]);
}
int dp(int u) {
  if (f[u]) return f[u];
  int e;
  for (f[u] = s[u], e = f2[u]; e; e = n2[e]) f[u] += dp(t2[e]);
  return f[u];
}
void travel(int u) {
  chosen[u] = 1;
  int v, e;
  for (e = f2[u]; e; e = n2[e])
    if (!chosen[t2[e]]) travel(t2[e]);
}
int main() {
  scanf("%d%d%d", &n, &m, &h);
  int i, u, v;
  for (i = 1; i <= n; i++) scanf("%d", &t[i]);
  memset(first, 0, sizeof(first));
  for (sz = 0, i = 1; i <= m; i++) {
    scanf("%d%d", &u, &v);
    if (t[v] == (t[u] + 1) % h) addedge(u, v);
    if (t[u] == (t[v] + 1) % h) addedge(v, u);
  }
  scc_dec();
  memset(f, 0, sizeof(f));
  int ans = n + 1, ss;
  for (i = 1; i <= cnt; i++)
    if (dp(i) < ans) {
      ans = dp(i);
      ss = i;
    }
  if (ans < 0) {
    printf("test: %d %d %d\n", ss, cnt, l);
    for (i = 1; i <= cnt; i++) printf("%d ", s[i]);
  }
  printf("%d\n", ans);
  memset(chosen, 0, sizeof(chosen));
  travel(ss);
  for (i = 1; i <= n; i++)
    if (chosen[scc[i]]) printf("%d ", i);
  puts("");
  return 0;
}
