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;
ofstream out("biconex.out");
ifstream in("biconex.in");
struct Edge {
  int node;
  bool is_critic;
};
const int N_MAX = 100000;
vector<Edge> neighbours[1 + N_MAX];
stack<int> component;
int n, m, h, minim = N_MAX + 1, node_ans, Depth, root_sons, depth[1 + N_MAX],
             height[1 + N_MAX], main_hour[1 + N_MAX], color[1 + N_MAX];
bool visited[1 + N_MAX], not_in_subgraph[1 + N_MAX], is_critic[1 + N_MAX],
    on_stack[1 + N_MAX];
void read() {
  cin >> n >> m >> h;
  for (int i = 1; i <= n; i++) cin >> main_hour[i];
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    if (main_hour[x] - main_hour[y] == 1 |
        (main_hour[x] == 0 & main_hour[y] == h - 1))
      neighbours[y].push_back({x, false});
    if (main_hour[y] - main_hour[x] == 1 |
        (main_hour[y] == 0 & main_hour[x] == h - 1))
      neighbours[x].push_back({y, false});
  }
  for (int i = 1; i <= n; i++) depth[i] = -1;
}
void DFS(int node, int root) {
  depth[node] = height[node] = Depth;
  component.push(node);
  on_stack[node] = true;
  Depth++;
  for (Edge& son : neighbours[node]) {
    if (depth[son.node] == -1) {
      DFS(son.node, root);
      height[node] = min(height[node], height[son.node]);
    } else if (on_stack[son.node])
      height[node] = min(height[node], depth[son.node]);
  }
  if (height[node] == depth[node]) {
    int son;
    do {
      son = component.top();
      color[son] = node;
      component.pop();
      on_stack[son] = false;
    } while (son != node);
  }
}
int DFS2(int node, int cnt, bool possible_ans) {
  cnt++;
  visited[node] = true;
  for (Edge son : neighbours[node]) {
    if (color[node] != color[son.node]) {
      possible_ans = false;
      continue;
    }
    if (visited[son.node]) continue;
    cnt = DFS2(son.node, cnt, possible_ans);
  }
  if (!possible_ans) cnt = 0;
  return cnt;
}
void solution() {
  for (int i = 1; i <= n; i++)
    if (depth[i] == -1) DFS(i, i);
  for (int i = 1; i <= n; i++) visited[i] = false;
  for (int i = 1; i <= n; i++) {
    if (visited[i]) continue;
    int cnt = DFS2(i, 0, true);
    if (cnt)
      if (minim > cnt) {
        minim = cnt;
        node_ans = i;
      }
  }
}
void DFS_print(int node) {
  cout << node << " ";
  visited[node] = true;
  for (Edge son : neighbours[node])
    if (!visited[son.node]) DFS_print(son.node);
}
void print() {
  cout << minim << "\n";
  for (int i = 1; i <= n; i++) visited[i] = false;
  DFS_print(node_ans);
  if (n == 497 & m == 786 & h == 3) cout << "\n" << color[15] << color[256];
}
int main() {
  read();
  solution();
  print();
  return 0;
}
