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 N = 1e5 + 10;
int u[N], u1[N], a[N], b[N];
bool ok1 = true, ok2 = true;
vector<int> ans1, ans2;
int n, m, h;
vector<int> g[N], rg[N], order, compressed[N];
bool vis[N];
int comp[N], val[N], ncomps;
void dfs1(int v) {
  vis[v] = true;
  for (int u : g[v])
    if (!vis[u]) dfs1(u);
  order.push_back(v);
  return;
}
void dfs2(int v, int curr) {
  vis[v] = true;
  comp[v] = curr;
  compressed[curr].push_back(v);
  for (int u : rg[v])
    if (!vis[u]) dfs2(u, curr);
}
void SCC(int n) {
  memset(vis, false, sizeof(vis));
  order.clear();
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) dfs1(i);
  reverse((order).begin(), (order).end());
  memset(vis, false, sizeof(vis));
  int curr = 1;
  for (int v : order)
    if (!vis[v]) compressed[curr].clear(), dfs2(v, curr), ++curr;
  ncomps = curr - 1;
  return;
}
int VAR(int x) { return x << 1; }
int NOT(int x) { return x ^ 1; }
bool solvable(int n) {
  SCC(2 * n);
  for (int i = 1; i <= n; ++i)
    if (comp[VAR(i)] == comp[NOT(VAR(i))]) return false;
  return true;
}
void assign_values() {
  memset(val, 0, sizeof(val));
  for (int i = 1; i <= ncomps; ++i) {
    for (int v : compressed[i]) {
      int u = v >> 1;
      if (val[u]) continue;
      val[u] = (v & 1 ? 1 : -1);
    }
  }
}
void add_edge(int u, int v) { g[u].push_back(v), rg[v].push_back(u); }
void add_impl(int u, int v) { add_edge(u, v), add_edge(NOT(v), NOT(u)); }
void add_equiv(int u, int v) { add_impl(u, v), add_impl(v, u); }
void add_or(int u, int v) { add_edge(NOT(u), v), add_edge(NOT(v), u); }
void add_xor(int u, int v) { add_or(u, v), add_or(NOT(v), NOT(u)); }
void add_true(int u) { add_edge(NOT(u), u); }
set<pair<int, int> > edges;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m >> h;
  for (int i = 1; i <= n; ++i) cin >> u[i], u1[i] = u[i];
  for (int i = 1; i <= m; ++i) {
    cin >> a[i] >> b[i];
    if (!edges.count({a[i], b[i]}))
      if ((u[a[i]] + 1) % h == u[b[i]])
        g[a[i]].push_back(b[i]), rg[b[i]].push_back(a[i]),
            edges.insert({a[i], b[i]});
    if (!edges.count({b[i], a[i]}))
      if ((u[b[i]] + 1) % h == u[a[i]])
        g[b[i]].push_back(a[i]), rg[a[i]].push_back(b[i]),
            edges.insert({b[i], a[i]});
  }
  SCC(n);
  int idx = 1;
  int mn = N;
  for (int i = 1; i <= ncomps; ++i) {
    if ((int)(compressed[i]).size() < mn)
      mn = (int)(compressed[i]).size(), idx = i;
  }
  cout << (int)(compressed[idx]).size() << endl;
  for (int u : compressed[idx]) cout << u << ' ';
  cout << endl;
  return 0;
}
