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 U[1111111];
vector<int> edges[1111111];
int foundat;
vector<vector<int> > scc;
vector<int> disc, low;
bool onstack[2551555];
stack<int> st;
void tarjan(int u) {
  disc[u] = low[u] = foundat++;
  st.push(u);
  onstack[u] = true;
  for (auto i : edges[u]) {
    if (disc[i] == -1) {
      tarjan(i);
      low[u] = min(low[u], low[i]);
    } else if (onstack[i])
      low[u] = min(low[u], disc[i]);
  }
  if (disc[u] == low[u]) {
    vector<int> scctem;
    while (1) {
      int v = st.top();
      st.pop();
      onstack[v] = false;
      scctem.push_back(v);
      if (u == v) break;
    }
    scc.push_back(scctem);
  }
}
long long dp[1555155];
int ids[1551555];
set<int> edges_comp[1155555];
int outdegree[1555155];
long long Solve(int u) {
  if (dp[u] != -1) return dp[u];
  long long ret = scc[u].size();
  for (int v : edges_comp[u]) {
    ret += Solve(v);
  }
  return dp[u] = ret;
}
bool done[122222];
void dfs(int u) {
  if (done[u]) return;
  done[u] = true;
  for (int v : edges[u]) {
    if (!done[v]) dfs(v);
  }
}
int main() {
  int N, m, h;
  cin >> N >> m >> h;
  for (int i = 1; i <= N; i++) {
    cin >> U[i];
    onstack[i] = false;
  }
  for (int i = 1; i <= m; i++) {
    int c1, c2;
    cin >> c1 >> c2;
    if ((U[c1] + 1) % h == U[c2]) edges[c1].push_back(c2);
    if ((U[c2] + 1) % h == U[c1]) edges[c2].push_back(c1);
  }
  foundat = 1;
  disc.clear();
  disc.resize(N + 1, -1);
  low.clear();
  low.resize(N + 1);
  scc.clear();
  for (int i = 1; i <= N; i++) {
    if (disc[i] == -1) tarjan(i);
  }
  for (int j = 0; j < scc.size(); j++) {
    for (int y : scc[j]) {
      ids[y] = j;
    }
  }
  int numscc = scc.size();
  for (int i = 0; i < numscc; i++) {
    edges_comp[i].clear();
    outdegree[i] = 0;
  }
  for (int i = 1; i <= N; i++) {
    for (int j : edges[i]) {
      if (ids[i] != ids[j]) {
        edges_comp[ids[i]].insert(ids[j]);
        outdegree[ids[i]]++;
      }
    }
  }
  long long ans = 1111111111111111ll;
  int id = -1;
  for (int i = 0; i < numscc; i++) {
    if (outdegree[i] == 0 && ans > (long long)scc[i].size()) {
      ans = scc[i].size();
      id = i;
    }
  }
  cout << ans << endl;
  for (int u : scc[id]) printf("%d ", u);
  cout << endl;
  return 0;
}
