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>
const int max_n = 200000;
std::vector<int> G[max_n];
int C[max_n];
int update[max_n];
int n, c, m;
std::vector<std::vector<int>> solution;
std::vector<int> current;
int D[max_n], S[max_n], InS[max_n];
int top, ile, tt;
int delta[max_n], eta[max_n];
int best;
void dfs(std::vector<int> *G, int v, int *C) {
  S[top++] = v;
  InS[v] = 1;
  delta[v] = eta[v] = ++tt;
  D[v] = 1;
  for (int i = 0; i < G[v].size(); ++i) {
    if (D[G[v][i]] == 0) {
      dfs(G, G[v][i], C);
      eta[v] = std::min(eta[v], eta[G[v][i]]);
    } else if (delta[G[v][i]] < delta[v] && InS[G[v][i]])
      eta[v] = std::min(eta[v], delta[G[v][i]]);
  }
  if (delta[v] == eta[v]) {
    ++ile;
    current.clear();
    while (top > 0 && delta[v] <= delta[S[top - 1]]) {
      --top;
      InS[S[top]] = 0;
      C[S[top]] = ile;
      current.push_back(S[top] + 1);
    }
    solution.push_back(current);
  }
}
int lmSCCTarjanAlgo(std::vector<int> *G, int n, int *C) {
  for (int i = 0; i < n; ++i) D[i] = InS[i] = 0;
  top = ile = tt = 0;
  for (int i = 0; i < n; ++i)
    if (!D[i]) dfs(G, i, C);
  return ile;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin >> n >> c >> m;
  for (int i = 0; i < n; ++i) {
    std::cin >> update[i];
  }
  for (int i = 0; i < c; ++i) {
    int a, b;
    std::cin >> a >> b;
    --a, --b;
    if ((update[a] + 1) % m == update[b]) {
      G[a].push_back(b);
    }
    if ((update[b] + 1) % m == update[a]) {
      G[b].push_back(a);
    }
  }
  best = n + 1;
  lmSCCTarjanAlgo(G, n, C);
  best = n + 1;
  int indeks = -1;
  for (int i = 0; i < solution.size(); ++i) {
    bool good = true;
    for (int j = 0; j < solution[i].size(); ++j) {
      int v = solution[i][j] - 1;
      for (int k = 0; k < G[v].size(); ++k) {
        if (C[v] != C[G[v][k]]) good = false;
      }
    }
    if (good && solution[i].size() < best) {
      best = solution[i].size();
      indeks = i;
    }
  }
  std::cout << best << std::endl;
  for (int i = 0; i < best; ++i) {
    std::cout << solution[indeks][i] << " ";
  }
  return 0;
}
