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;
inline int read() {
  int x = 0, f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -1;
  } while (ch < '0' || ch > '9');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return x * f;
}
const int N = 100010, M = 100010;
const int INF = 0x3f3f3f3f;
int data[N];
struct G {
  struct node {
    int u, v, next;
  } edge[M << 1];
  int last[N], le;
  void add(int u, int v) {
    edge[++le].u = u, edge[le].v = v, edge[le].next = last[u], last[u] = le;
  }
  void cl() {
    memset(last, 0, sizeof(last));
    le = 0;
  }
} G1, G2;
int pre[N], low[N], scc_cnt, lt, scc_node[N], sccsz[N], in[N];
stack<int> s;
void dfs(int u) {
  pre[u] = low[u] = ++lt;
  s.push(u);
  for (int i = G1.last[u]; i; i = G1.edge[i].next) {
    int v = G1.edge[i].v;
    if (!pre[v]) {
      dfs(v);
    }
    if (!scc_node[v]) low[u] = min(low[u], low[v]);
  }
  if (pre[u] == low[u]) {
    ++scc_cnt;
    while (!s.empty()) {
      int x = s.top();
      s.pop();
      scc_node[x] = scc_cnt;
      ++sccsz[scc_cnt];
      if (u == x) break;
    }
  }
}
void init() {
  memset(pre, 0, sizeof(pre));
  memset(low, 0, sizeof(low));
  memset(scc_node, 0, sizeof(scc_node));
  memset(sccsz, 0, sizeof(sccsz));
  memset(in, 0, sizeof(in));
  scc_cnt = lt = 0;
}
int dp[N], vis[N];
int dfs2(int u) {
  if (dp[u]) return dp[u];
  dp[u] = sccsz[u];
  for (int i = G2.last[u]; i; i = G2.edge[i].next) {
    int v = G2.edge[i].v;
    dp[u] += dfs2(v);
  }
  return dp[u];
}
int tans[N], la;
void dfs3(int u) {
  tans[++la] = u;
  vis[u] = 1;
  for (int i = G1.last[u]; i; i = G1.edge[i].next) {
    int v = G1.edge[i].v;
    if (!vis[v]) dfs3(v);
  }
}
int main() {
  init();
  G1.cl(), G2.cl();
  int n = read(), m = read(), h = read();
  for (int i = 1; i <= n; ++i) data[i] = read();
  for (int i = 1; i <= m; ++i) {
    int u = read(), v = read();
    if (data[u] + 1 == data[v] || data[u] + 1 == data[v] + h) G1.add(u, v);
    if (data[v] + 1 == data[u] || data[v] + 1 == data[u] + h) G1.add(v, u);
  }
  for (int i = 1; i <= n; ++i)
    if (!pre[i]) dfs(i);
  for (int i = 1; i <= G1.le; ++i) {
    int u = G1.edge[i].u, v = G1.edge[i].v;
    if (scc_node[u] != scc_node[v])
      ++in[scc_node[v]], G2.add(scc_node[u], scc_node[v]);
  }
  for (int i = 1; i <= scc_cnt; ++i)
    if (!in[i]) dfs2(i);
  int ans = INF;
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; ++i) {
    int num = dp[scc_node[i]];
    if (num < ans) ans = num;
  }
  memset(vis, 0, sizeof(vis));
  la = 0;
  for (int i = 1; i <= n; ++i) {
    int num = dp[scc_node[i]];
    if (num == ans) {
      dfs3(i);
      break;
    }
  }
  if (ans < 0) {
    printf("%d\n", scc_cnt);
    printf("%d %d\n", ans, la);
    printf("%d %d\n", G1.le, G2.le);
    for (int i = 1; i <= la; ++i) printf("%d ", tans[i]);
  }
  printf("%d\n", ans);
  for (int i = 1; i <= la; ++i) printf("%d ", tans[i]);
  return 0;
}
