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;
vector<vector<int> > lista, listaR;
int d[100001], e[100001], D[100001];
vector<int> v;
int i = 1;
class DisjointSet {
 private:
  int *A, *S;
  int C;

 public:
  DisjointSet(int n) {
    A = (int *)malloc(n * sizeof(int));
    S = (int *)malloc(n * sizeof(int));
    for (int x = 0; x < n; x++) {
      A[x] = x;
      S[x] = 1;
    }
    C = n;
  }
  int padre(int x) {
    if (x != A[x]) A[x] = padre(A[x]);
    return A[x];
  }
  void unir(int i, int j) {
    int a = padre(i);
    int b = padre(j);
    if (a == b) return;
    C--;
    if (S[a] < S[b]) swap(a, b);
    S[a] += S[b];
    A[b] = a;
  }
  int getComponentes() { return C; }
  int getTam(int x) { return S[x]; }
};
DisjointSet *ds;
void DFS(int n) {
  e[n] = i++;
  for (auto j : lista[n])
    if (e[j] == 0) DFS(j);
  e[n] = i++;
  v.push_back(n);
}
void DFS2(int n, int p) {
  ds->unir(n, p);
  D[n] = 1;
  for (auto j : listaR[n])
    if (D[j] == 0) DFS2(j, p);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, h, x, a, b;
  cin >> n >> m >> h;
  for (x = 0; x < n; x++) cin >> d[x];
  lista.resize(n + 1);
  listaR.resize(n + 1);
  for (x = 0; x < m; x++) {
    cin >> a >> b;
    a--;
    b--;
    if ((d[a] + 1) % h == d[b]) {
      lista[a].push_back(b);
      listaR[b].push_back(a);
    }
    if ((d[b] + 1) % h == d[a]) {
      lista[b].push_back(a);
      listaR[a].push_back(b);
    }
  }
  for (x = 0; x < n; x++)
    if (lista[x].size() == 0) {
      cout << 1 << endl << x + 1 << endl;
      return 0;
    }
  for (x = 0; x < n; x++)
    if (e[x] == 0) DFS(x);
  DisjointSet DS(n);
  ds = &DS;
  for (x = n - 1; x >= 0; x--)
    if (ds->padre(v[x]) == v[x]) DFS2(v[x], v[x]);
  int M = 1e9, p;
  for (x = 0; x < n; x++) {
    int k = ds->getTam(ds->padre(x));
    if (k > 1 && k < M) {
      M = k;
      p = ds->padre(x);
    }
  }
  cout << M << endl;
  for (x = 0; x < n; x++)
    if (ds->padre(x) == p) cout << x + 1 << " ";
  cout << endl;
  return 0;
}
