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 INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-12;
const double PI = acos(-1.0);
const double angcst = PI / 180.0;
const long long mod = 998244353;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long qmul(long long a, long long b) {
  long long r = 0;
  while (b) {
    if (b & 1) r = (r + a) % mod;
    b >>= 1;
    a = (a + a) % mod;
  }
  return r;
}
long long qpow(long long a, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * a) % mod;
    n >>= 1;
    a = (a * a) % mod;
  }
  return r;
}
long long qpow(long long a, long long n, long long p) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * a) % p;
    n >>= 1;
    a = (a * a) % p;
  }
  return r;
}
const int maxn = 200050, maxm = 1000050, maxk = 200050;
struct Edge {
  int to, next;
} eg[maxm];
int pre[maxn], lowlink[maxn], sccno[maxn], head[maxn];
int STACK[maxk], STACKTop;
int dfs_clock, scc_cnt, tot;
bool ins[maxn];
inline void SPush(int a) { STACK[STACKTop++] = a; }
inline void SPop() { STACKTop--; }
inline bool SEmpty() { return STACKTop == 0; }
inline int STop() { return STACK[STACKTop - 1]; }
void init(int nn) {
  dfs_clock = scc_cnt = STACKTop = tot = 0;
  memset(head, -1, (nn << 2) + 5);
  memset(sccno, 0, (nn << 2) + 5);
  memset(pre, 0, (nn << 2) + 5);
  memset(ins, false, nn + 5);
}
void addedge(int u, int v) {
  eg[tot].to = v;
  eg[tot].next = head[u];
  head[u] = tot++;
}
void tarjan(int in) {
  pre[in] = lowlink[in] = ++dfs_clock;
  SPush(in);
  ins[in] = true;
  for (int i = head[in]; i != -1; i = eg[i].next) {
    int &v = eg[i].to;
    if (!pre[v]) {
      tarjan(v);
      lowlink[in] = min(lowlink[in], lowlink[v]);
    } else if (ins[v])
      lowlink[in] = min(lowlink[in], pre[v]);
  }
  if (lowlink[in] == pre[in]) {
    scc_cnt++;
    while (1) {
      int x = STop();
      SPop();
      sccno[x] = scc_cnt;
      ins[x] = false;
      if (x == in) break;
    }
  }
}
int u[100050];
int ind[100050], outd[100050], cnt[100050];
pair<int, int> pr[100050];
int pcnt = 0;
void solve() {
  int n, m, h, a, b;
  cin >> n >> m >> h;
  init(n);
  for (int i = (1); i <= (n); i++) cin >> u[i];
  for (int i = (1); i <= (m); i++) {
    cin >> a >> b;
    if ((u[b] + 1) % h == u[a]) {
      addedge(b, a);
      pr[pcnt++] = pair<int, int>(b, a);
    }
    if ((u[a] + 1) % h == u[b]) {
      addedge(a, b);
      pr[pcnt++] = pair<int, int>(a, b);
    }
  }
  for (int i = (1); i <= (n); i++)
    if (!pre[i]) tarjan(i);
  for (int i = (0); i < (pcnt); i++) {
    if (sccno[pr[i].first] != sccno[pr[i].second]) {
      outd[sccno[pr[i].first]]++;
      ind[sccno[pr[i].second]]++;
    }
  }
  for (int i = (1); i <= (n); i++) {
    cnt[sccno[i]]++;
  }
  int ans = n, p = 1;
  for (int i = (1); i <= (scc_cnt); i++) {
    if (cnt[i] < ans && outd[i] == 0) {
      ans = cnt[i];
      p = i;
    }
  }
  cout << ans << '\n';
  for (int i = (1); i <= (n); i++)
    if (sccno[i] == p) cout << i << ' ';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  { solve(); }
  return 0;
}
