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>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
stack<int> st;
vector<vector<int> > scc;
int low[100005], disc[100005], comp[100005];
int dfs_time, off[100005];
bool in_stack[100005];
vector<int> graph[100005];
int n, csize[100005];
void dfs(int u) {
  low[u] = dfs_time;
  disc[u] = dfs_time;
  dfs_time++;
  in_stack[u] = true;
  st.push(u);
  int sz = graph[u].size(), v;
  for (int i = 0; i < sz; i++) {
    v = graph[u][i];
    if (disc[v] == -1) {
      dfs(v);
      low[u] = min(low[u], low[v]);
    } else if (in_stack[v] == true)
      low[u] = min(low[u], disc[v]);
  }
  if (low[u] == disc[u]) {
    scc.push_back(vector<int>());
    while (st.top() != u) {
      scc[scc.size() - 1].push_back(st.top());
      in_stack[st.top()] = false;
      st.pop();
    }
    scc[scc.size() - 1].push_back(u);
    in_stack[u] = false;
    st.pop();
  }
}
int tarjan() {
  memset(comp, -1, sizeof(comp));
  memset(disc, -1, sizeof(disc));
  memset(low, -1, sizeof(low));
  memset(in_stack, 0, sizeof(in_stack));
  dfs_time = 0;
  while (!st.empty()) st.pop();
  for (int i = 1; i <= n; i++)
    if (disc[i] == -1) dfs(i);
  int sz = scc.size();
  for (int i = 0; i < sz; i++)
    for (int j = 0; j < (int)scc[i].size(); j++)
      comp[scc[i][j]] = i, csize[i]++;
  return sz;
}
bool visited[100005];
int in[100005];
long long dp[100005];
vector<int> dag[100005];
map<pair<int, int>, bool> done;
void gendag(int u) {
  visited[u] = true;
  for (auto v : graph[u]) {
    if (comp[u] != comp[v] && done.find({comp[u], comp[v]}) == done.end()) {
      dag[comp[u]].push_back(comp[v]);
      in[comp[v]]++;
      done[{comp[u], comp[v]}] = true;
    }
    if (!visited[v]) gendag(v);
  }
}
void go(int u) {
  visited[u] = true;
  dp[u] = csize[u];
  for (auto v : dag[u]) {
    if (!visited[v]) {
      go(v);
    }
    dp[u] += dp[v];
  }
}
int main() {
  int test, cases = 1;
  int m, h;
  scanf("%d%d%d", &n, &m, &h);
  for (int i = (1); i < (n + 1); i++) scanf("%d", &off[i]);
  int u, v;
  for (int i = (1); i < (m + 1); i++) {
    scanf("%d%d", &u, &v);
    if ((off[u] + 1) % h == off[v]) {
      graph[u].push_back(v);
    }
    if ((off[v] + 1) % h == off[u]) {
      graph[v].push_back(u);
    }
  }
  int sz = tarjan();
  for (int i = (1); i < (n + 1); i++) {
    if (!visited[i]) gendag(i);
  }
  memset(visited, false, sizeof(visited));
  for (int i = (0); i < (sz); i++) {
    if (in[i] == 0) {
      go(i);
    }
  }
  int mnsz = 1e8, idx = 0;
  for (int i = (0); i < (sz); i++) {
    if (dp[i] < mnsz) {
      mnsz = csize[i];
      idx = i;
    }
  }
  printf("%d\n", mnsz);
  for (int i = (1); i < (n + 1); i++)
    if (comp[i] == idx) printf("%d ", i);
  puts("");
  return 0;
}
