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 sum = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    sum = (sum << 1) + (sum << 3) + (c ^ 48);
    c = getchar();
  }
  return sum;
}
int const maxn = 100005;
int n, m, h, cnt, num, top, col, H[maxn], a[maxn], dfn[maxn], low[maxn],
    size[maxn], co[maxn], s[maxn], f[maxn], ru[maxn];
queue<int> q;
struct Edge {
  int next, to;
} E[maxn << 1];
struct edge {
  int from, to;
} E2[maxn << 1];
inline void add(int a, int b) {
  E[++cnt] = (Edge){H[a], b};
  E2[cnt] = (edge){a, b};
  H[a] = cnt;
}
void tarjan(int x) {
  dfn[x] = low[x] = ++num;
  s[++top] = x;
  for (int i = H[x]; i; i = E[i].next) {
    int y = E[i].to;
    if (!dfn[y]) {
      tarjan(y);
      low[x] = min(low[x], low[y]);
    } else if (!co[y])
      low[x] = min(low[x], dfn[y]);
  }
  if (low[x] == dfn[x]) {
    co[x] = ++col;
    size[col] = 1;
    while (s[top] != x) {
      co[s[top]] = col;
      size[col]++;
      top--;
    }
    top--;
  }
}
inline bool cmp(edge x, edge y) {
  if (x.from == y.from) return x.to < y.to;
  return x.from < y.from;
}
int main() {
  n = read(), m = read(), h = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    if ((a[x] + 1) % h == a[y]) add(x, y);
    if ((a[y] + 1) % h == a[x]) add(y, x);
  }
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i);
  int edge_num = cnt;
  memset(H, 0, sizeof(H));
  cnt = 0;
  for (int i = 1; i <= edge_num; i++)
    E2[i].from = co[E2[i].from], E2[i].to = co[E2[i].to];
  sort(E2 + 1, E2 + edge_num + 1, cmp);
  for (int i = 1; i <= edge_num; i++)
    if (E2[i].from != E2[i].to &&
        (E2[i].from != E2[i - 1].from || E2[i].to != E2[i - 1].to))
      add(E2[i].to, E2[i].from), ru[E2[i].from]++;
  for (int i = 1; i <= col; i++) {
    if (ru[i] == 0) q.push(i);
    f[i] = size[i];
  }
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int i = H[x]; i; i = E[i].next) {
      int y = E[i].to;
      f[y] += f[x];
      ru[y]--;
      if (ru[y] == 0) q.push(y);
    }
  }
  int ans = 0x3f3f3f3f, ansnum = 0;
  for (int i = 1; i <= col; i++)
    if (f[i] < ans) ans = f[i], ansnum = i;
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++)
    if (co[i] == ansnum) printf("%d ", i);
  putchar('\n');
}
