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;
void dfs1(vector<vector<int64_t>>& g, vector<bool>& used,
          vector<int64_t>& topsort, int64_t v) {
  used[v] = true;
  for (int64_t i = 0; i < g[v].size(); ++i) {
    if (!used[g[v][i]]) {
      dfs1(g, used, topsort, g[v][i]);
    }
  }
  topsort.push_back(v);
}
void dfs2(vector<vector<int64_t>>& g, vector<int64_t>& component, int64_t v,
          int64_t k) {
  component[v] = k;
  for (int64_t i = 0; i < g[v].size(); ++i) {
    if (component[g[v][i]] == 0) {
      dfs2(g, component, g[v][i], k);
    }
  }
}
int main() {
  int64_t n, m, h;
  cin >> n >> m >> h;
  vector<int64_t> color(n);
  vector<vector<int64_t>> g(n);
  vector<vector<int64_t>> gr(n);
  for (int64_t i = 0; i < n; ++i) {
    cin >> color[i];
  }
  vector<pair<int64_t, int64_t>> edge;
  for (int64_t i = 0; i < m; ++i) {
    int64_t v, u;
    cin >> v >> u;
    --v;
    --u;
    if ((color[v] + 1) % h == color[u]) {
      g[v].push_back(u);
      gr[u].push_back(v);
      edge.push_back(make_pair(v, u));
    }
    if ((color[u] + 1) % h == color[v]) {
      g[u].push_back(v);
      gr[v].push_back(u);
      edge.push_back(make_pair(u, v));
    }
  }
  vector<int64_t> topsort;
  vector<bool> used(n);
  for (int64_t i = 0; i < n; ++i) {
    if (!used[i]) {
      dfs1(g, used, topsort, i);
    }
  }
  vector<int64_t> component(n);
  int64_t k = 1;
  for (int64_t i = n - 1; i >= 0; --i) {
    if (component[topsort[i]] == 0) {
      dfs2(gr, component, topsort[i], k);
      ++k;
    }
  }
  vector<int64_t> cnt(k + 1);
  vector<bool> isStok(k + 1, true);
  for (int64_t i = 0; i < n; ++i) {
    ++cnt[component[i]];
  }
  for (int64_t i = 0; i < edge.size(); ++i) {
    if (component[edge[i].first] != component[edge[i].second]) {
      isStok[component[edge[i].first]] = false;
    }
  }
  int64_t mn = 1e9;
  for (int64_t i = 1; i < k; ++i) {
    if (isStok[i] && cnt[i] < mn) {
      mn = cnt[i];
    }
  }
  for (int64_t i = 1; i < k; ++i) {
    if (isStok[i] && cnt[i] == mn) {
      cout << mn << endl;
      for (int j = 0; j < n; ++j) {
        if (component[j] == i) {
          cout << j + 1 << " ";
        }
      }
      return 0;
    }
  }
  return 0;
}
