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;
int n, m, h, tot, tot2, tot3, la[800080], la2[800080], la3[800080], u[800080],
    cnt, ans[800080], scc[800080], S[800080], tmp, dp[800080], sum[800080];
bool vis[800080];
struct edge {
  int v, ne;
} e[800080 << 1], e2[800080 << 1], e3[800080 << 1];
void add(int u, int v) { e[tot].v = v, e[tot].ne = la[u], la[u] = tot++; }
void add2(int u, int v) {
  e2[tot2].v = v, e2[tot2].ne = la2[u], la2[u] = tot2++;
}
void add3(int u, int v) {
  e3[tot3].v = v, e3[tot3].ne = la3[u], la3[u] = tot3++;
}
void init() {
  tmp = cnt = tot = tot2 = tot3 = 0;
  memset(vis, 0, sizeof(vis));
  memset(la, -1, sizeof(la));
  memset(dp, 0, sizeof(dp));
  memset(la2, -1, sizeof(la2));
  memset(la3, -1, sizeof(la3));
  memset(sum, 0, sizeof(sum));
  scanf("%d%d%d", &n, &m, &h);
  for (int i = 1; i <= n; ++i) scanf("%d", &u[i]);
  for (int i = 1; i <= m; ++i) {
    int c1, c2;
    scanf("%d%d", &c1, &c2);
    if ((u[c1] + 1) % h == u[c2]) add(c1, c2), add2(c2, c1);
    if ((u[c2] + 1) % h == u[c1]) add(c2, c1), add2(c1, c2);
  }
}
void dfs(int s) {
  vis[s] = 1;
  for (int i = la2[s]; ~i; i = e2[i].ne) {
    int t = e2[i].v;
    if (!vis[t]) dfs(t);
  }
  S[++tmp] = s;
}
void dfs2(int s) {
  scc[s] = cnt;
  ++sum[cnt];
  for (int i = la[s]; ~i; i = e[i].ne) {
    int t = e[i].v;
    if (!scc[t]) dfs2(t);
  }
}
void dfs3(int s) {
  dp[s] = sum[s];
  for (int i = la3[s]; ~i; i = e3[i].ne) {
    int t = e3[i].v;
    if (!dp[t]) dfs3(t);
    dp[s] += dp[t];
  }
}
void dfs4(int s) {
  vis[s] = 1;
  ans[++tmp] = s;
  for (int i = la[s]; ~i; i = e[i].ne) {
    int t = e[i].v;
    if (!vis[t]) dfs4(t);
  }
}
void solve() {
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) dfs(i);
  for (int i = n; i; --i)
    if (!scc[S[i]]) {
      ++cnt;
      dfs2(S[i]);
    }
  for (int s = 1; s <= n; ++s) {
    for (int i = la[s]; ~i; i = e[i].ne) {
      int t = e[i].v;
      if (scc[s] != scc[t]) add3(scc[s], scc[t]);
    }
  }
  int minx = 800080;
  for (int i = 1; i <= cnt; ++i) {
    if (!dp[i]) dfs3(i);
    minx = min(minx, dp[i]);
  }
  cout << minx << endl;
  tmp = 0;
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; ++i)
    if (dp[scc[i]] == minx) {
      dfs4(i);
      break;
    }
  sort(ans + 1, ans + minx + 1);
  for (int i = 1; i <= minx; ++i) cout << ans[i] << " ";
}
int main() {
  init();
  solve();
  return 0;
}
