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 = 2e5 + 5;
int u[N];
int c[N][2];
int n, m, h;
int dp[N];
vector<vector<int> > SCCs;
vector<int> compIndex, ind, lowLink;
stack<int> st;
vector<bool> inst;
vector<vector<int> > adj;
int idx = 0;
void tarjanSCC(int i) {
  lowLink[i] = ind[i] = idx++;
  st.push(i);
  inst[i] = true;
  for (int j = 0; j < adj[i].size(); j++) {
    int k = adj[i][j];
    if (ind[k] == -1) {
      tarjanSCC(k);
      lowLink[i] = min(lowLink[i], lowLink[k]);
    } else if (inst[k]) {
      lowLink[i] = min(lowLink[i], lowLink[k]);
    }
  }
  if (lowLink[i] == ind[i]) {
    vector<int> comp;
    int n = -1;
    while (n != i) {
      n = st.top();
      st.pop();
      comp.push_back(n);
      inst[n] = 0;
      compIndex[n] = SCCs.size();
    }
    SCCs.push_back(comp);
  }
}
void SCC() {
  SCCs.clear();
  compIndex.resize(adj.size());
  ind.clear();
  ind.resize(adj.size(), -1);
  lowLink.resize(adj.size());
  inst.resize(adj.size());
  idx = 0;
  for (int i = int(1); i <= int(n); i++)
    if (ind[i] == -1) tarjanSCC(i);
}
int cntSrc, cntSnk;
vector<vector<int> > cmpAdj;
vector<int> inDeg, outDeg;
void computeNewGraph() {
  outDeg.clear();
  outDeg.resize(SCCs.size());
  inDeg.clear();
  inDeg.resize(SCCs.size());
  cntSrc = cntSnk = SCCs.size();
  cmpAdj.clear();
  cmpAdj.resize(SCCs.size());
  for (int i = int(1); i <= int(n); i++) {
    for (int k : adj[i]) {
      if (compIndex[k] != compIndex[i]) {
        cmpAdj[compIndex[i]].push_back(compIndex[k]);
        if (!(inDeg[compIndex[k]]++)) cntSrc--;
        if (!(outDeg[compIndex[i]]++)) cntSnk--;
      }
    }
  }
}
bool check(int a, int b) {
  a = u[a], b = u[b];
  return min(a, b) + 1 == max(a, b) || max(a, b) == h - 1 && min(a, b) == 0;
}
void add(int a, int b) {
  if (u[a] + 1 == u[b] || u[a] == h - 1 && u[b] == 0) adj[a].push_back(b);
  swap(a, b);
  if (u[a] + 1 == u[b] || u[a] == h - 1 && u[b] == 0) adj[a].push_back(b);
}
int main() {
  scanf("%d %d %d", &n, &m, &h);
  adj.resize(n + 1);
  for (int i = int(1); i <= int(n); i++) scanf("%d", &u[i]);
  for (int i = int(1); i <= int(m); i++) scanf("%d %d", &c[i][0], &c[i][1]);
  for (int i = int(1); i <= int(m); i++) {
    if (check(c[i][0], c[i][1])) {
      add(c[i][0], c[i][1]);
    }
  }
  for (int i = int(1); i <= int(n); i++) {
    if (!int(adj[i].size())) {
      puts("1");
      cout << i << endl;
      return 0;
    }
  }
  int ans = N, idx = -1;
  SCC();
  computeNewGraph();
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < int(int(SCCs.size())); i++) {
    if (int(cmpAdj[i].size()) == 0 && ans > int(SCCs[i].size())) {
      ans = int(SCCs[i].size());
      idx = i;
    }
  }
  printf("%d\n", int(SCCs[idx].size()));
  for (int nxt : SCCs[idx]) printf("%d ", nxt);
  return 0;
}
