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 std ::max;
using std ::min;
template <class T>
bool chkmin(T &x, const T &y) {
  return y < x ? x = y, true : false;
}
template <class T>
bool chkmax(T &x, const T &y) {
  return y > x ? x = y, true : false;
}
class FastInput {
 private:
  static const int L = 1 << 15 | 1;
  char buffer[L], *_, *__;
  inline void Next(char &ch) {
    if (_ == __) __ = (_ = buffer) + fread(buffer, 1, L, stdin);
    ch = _ == __ ? EOF : *_++;
  }

 public:
  template <class T>
  void operator()(T &in) {
    char ch;
    int f = 1;
    for (Next(ch); !isdigit(ch); Next(ch))
      if (ch == '-') f = -1;
    for (in = 0; isdigit(ch); Next(ch)) in = in * 10 + ch - '0';
    in *= f;
  }
};
const int maxx = 200000 + 25;
int n, m, x, y, z, k, num = 1;
int cnt, tot, front, back, mx, mn;
int len, t1, t2, h, top, ans;
int a[maxx], vis[maxx], u[maxx], v[maxx];
int head[maxx], to[maxx], nxt[maxx];
int low[maxx], ddf[maxx], ink[maxx], vest[maxx], skt[maxx], size[maxx];
void Ins(int, int);
void Tarjan(int);
int main() {
  scanf("%d%d%d", &n, &m, &h);
  for (int i = (1), i_END = (n); i <= (i_END); ++i) scanf("%d", &a[i]);
  for (int i = (1), i_END = (m); i <= (i_END); ++i) {
    scanf("%d%d", &x, &y);
    if (a[x] == (a[y] + 1) % h) Ins(y, x);
    if (a[y] == (a[x] + 1) % h) Ins(x, y);
  }
  for (int i = (1), i_END = (n); i <= (i_END); ++i)
    if (!ddf[i]) Tarjan(i);
  for (int i = (1), i_END = (u[0]); i <= (i_END); ++i)
    if (vest[u[i]] != vest[v[i]]) vis[vest[u[i]]] = 1;
  ans = 20011025;
  for (int i = (1), i_END = (tot); i <= (i_END); ++i) {
    if (!vis[i]) {
      if (chkmin(ans, size[i])) cnt = i;
    }
  }
  printf("%d\n", ans);
  for (int i = (1), i_END = (n); i <= (i_END); ++i)
    if (vest[i] == cnt) printf("%d ", i);
  printf("\n");
  return 0;
}
void Ins(int x, int y) {
  u[++u[0]] = x;
  v[++v[0]] = y;
  to[++num] = y;
  nxt[num] = head[x];
  head[x] = num;
}
void Tarjan(int x) {
  ink[skt[++top] = x] = 1;
  ddf[x] = low[x] = ++cnt;
  for (int i = head[x]; i; i = nxt[i])
    if (!ddf[to[i]])
      Tarjan(to[i]), low[x] = min(low[x], low[to[i]]);
    else if (ink[to[i]])
      low[x] = min(low[x], low[to[i]]);
  if (ddf[x] == low[x]) {
    ++tot;
    while (x != skt[top + 1])
      ink[skt[top]] = 0, size[tot]++, vest[skt[top--]] = tot;
  }
}
