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 oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 1000 * 1000 * 1000 + 7;
const int N = 200005;
const double PI = acos(-1.0);
const double eps = 1e-9;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void file_put() {
  freopen("filename.in", "r", stdin);
  freopen("filename.out", "w", stdout);
}
int n, m, h, a[N], d[N], x, y, z, ans = oo;
vector<int> V[N], ret;
const int _N = 1e6 + 5, _M = 1e6 + 5;
struct Tu {
  int head[_N], nxt[_M], e[_M], n, tot;
  long long v[_N], w[_M];
  void Init(int _n) { n = _n, memset(head, 0, sizeof(head)), tot = 0; }
  void I(int x, int y, long long _w) {
    e[++tot] = y, w[tot] = _w;
    nxt[tot] = head[x], head[x] = tot;
  }
};
struct Tarjan {
  int id[_N], dfn[_N], low[_N], s[_N], n, r, t, tot;
  bool in[_N];
  void dfs(Tu &A, int x) {
    dfn[x] = low[x] = ++t, in[x] = 1, s[++r] = x;
    for (int i = A.head[x], y; i; i = A.nxt[i])
      if (!dfn[y = A.e[i]])
        dfs(A, y), low[x] = ((low[x]) < (low[y]) ? (low[x]) : (low[y]));
      else if (in[y])
        low[x] = ((low[x]) < (dfn[y]) ? (low[x]) : (dfn[y]));
    if (low[x] == dfn[x]) {
      ++tot;
      while (r && s[r + 1] != x) id[s[r]] = tot, in[s[r--]] = 0;
    }
  }
  void solve(Tu &A, Tu &B) {
    n = A.n;
    memset(dfn, 0, sizeof(dfn));
    memset(low, 0, sizeof(low));
    memset(in, 0, sizeof(in));
    r = tot = t = 0;
    for (int x = (1); x <= (n); ++x)
      if (!dfn[x]) dfs(A, x);
    B.Init(tot);
    memset(B.v, 0, sizeof(B.v));
    for (int x = (1); x <= (n); ++x)
      for (int i = A.head[x]; i; i = A.nxt[i])
        if (id[x] == id[A.e[i]])
          B.v[id[x]] += A.w[i];
        else
          B.I(id[x], id[A.e[i]], A.w[i]), d[id[x]]++;
    for (int x = (1); x <= (n); ++x) V[id[x]].push_back(x);
  }
};
Tu A, B;
Tarjan T;
int main() {
  scanf("%d%d%d", &n, &m, &h), A.Init(n);
  for (int i = (1); i <= (n); ++i) scanf("%d", &a[i]);
  for (int i = (1); i <= (m); ++i) {
    scanf("%d%d", &x, &y);
    if ((a[x] + 1) % h == a[y]) A.I(x, y, 0);
    if ((a[y] + 1) % h == a[x]) A.I(y, x, 0);
  }
  T.solve(A, B);
  for (int i = (1); i <= (B.n); ++i)
    if (!d[i] && V[i].size() < ans) ans = V[i].size(), ret.swap(V[i]);
  printf("%d\n", ans);
  for (__typeof((ret).begin()) it = (ret).begin(); it != (ret).end(); it++)
    printf("%d ", *it);
  printf("\n");
  return 0;
}
