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 N = 100005;
int n, m, h, i, j, x, y, p, t, sum;
int a[N], f[N], g[N], dfn[N], low[N], ans[N];
int b[N], lst[N], e[N * 2][2], c[N];
bool bz[N];
void link(int x, int y) { e[++t][0] = lst[x], e[t][1] = y, lst[x] = t; }
int find(int x) {
  if (x == f[x])
    return x;
  else
    return f[x] = find(f[x]);
}
void merge(int x, int y) {
  x = find(x), y = find(y);
  f[x] = y, g[y] += g[x];
}
void dg(int x) {
  dfn[x] = low[x] = ++t, c[++c[0]] = x, bz[x] = 1;
  int i = lst[x];
  while (i) {
    int y = e[i][1];
    i = e[i][0];
    if (!dfn[y])
      dg(y), low[x] = min(low[x], low[y]);
    else if (bz[y])
      low[x] = min(low[x], dfn[y]);
  }
  if (low[x] == dfn[x]) {
    while (x != c[c[0]]) merge(x, c[c[0]]), bz[c[c[0]--]] = 0;
    bz[x] = 0, c[0]--;
  }
}
void dg2(int x) {
  if (bz[x]) return;
  int i = lst[x];
  bz[x] = 1, ans[++ans[0]] = x;
  while (i) {
    int y = e[i][1];
    i = e[i][0], dg2(y);
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &h);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]), f[i] = i, g[i] = 1;
  for (i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    if ((a[x] + 1) % h == a[y]) link(x, y), b[x]++;
    if ((a[y] + 1) % h == a[x]) link(y, x), b[y]++;
  }
  for (i = 1; i <= n; i++)
    if (!b[i]) {
      ans[0] = 1, ans[1] = i;
      break;
    }
  if (!ans[0]) {
    t = 0;
    for (i = 1; i <= n; i++)
      if (!dfn[i]) dg(i);
    memset(b, 0, sizeof(b));
    c[0] = 0;
    for (i = 1; i <= n; i++) {
      j = lst[i], x = find(i);
      if (i == x) c[++c[0]] = i;
      while (j) {
        t = e[j][1], j = e[j][0], y = find(t);
        if (x != y) b[x]++;
      }
    }
    ans[0] = n + 1;
    for (i = 1; i <= c[0]; i++)
      if (!b[x = c[i]]) {
        if (g[x] < ans[0]) ans[0] = g[x], p = x;
      }
    memset(bz, 0, sizeof(bz));
    ans[0] = 0, dg2(p);
  }
  printf("%d\n", ans[0]);
  for (i = 1; i <= ans[0]; i++) printf("%d ", ans[i]);
}
