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<int> _sz, dsu;
vector<vector<int> > g, g1;
vector<set<int> > g2, g3;
vector<int> u;
vector<int> tout;
vector<int> used;
int timer = 0;
void dfs(int v) {
  used[v] = 1;
  timer++;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (!used[to]) {
      dfs(to);
    }
  }
  tout[v] = timer++;
}
int pred(int a) {
  if (a == dsu[a])
    return a;
  else
    return dsu[a] = pred(dsu[a]);
}
void unite(int a, int b) {
  a = pred(a);
  b = pred(b);
  if (a != b) {
    if (_sz[a] < _sz[b]) {
      swap(a, b);
    }
    dsu[b] = a;
    _sz[a] += _sz[b];
  }
}
vector<int> comp;
void dfs1(int v) {
  used[v] = 1;
  comp.push_back(v);
  for (int i = 0; i < g1[v].size(); i++) {
    int to = g1[v][i];
    if (!used[to]) {
      dfs1(to);
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m, h;
  cin >> n >> m >> h;
  _sz.resize(n);
  dsu.resize(n);
  for (int i = 0; i < n; i++) {
    dsu[i] = i;
    _sz[i] = 1;
  }
  g.resize(n);
  u.resize(n);
  g2.resize(n);
  g3.resize(n);
  used.resize(n);
  g1.resize(n);
  tout.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> u[i];
  }
  vector<pair<int, int> > vec(m);
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    vec[i] = {a, b};
    if ((u[a] + 1) % h == u[b]) {
      g[a].push_back(b);
      g1[b].push_back(a);
    }
    if ((u[b] + 1) % h == u[a]) {
      g1[a].push_back(b);
      g[b].push_back(a);
    }
  }
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      dfs(i);
    }
  }
  vector<pair<int, int> > mass;
  for (int i = 0; i < n; i++) {
    used[i] = 0;
    mass.push_back({tout[i], i});
  }
  sort(mass.begin(), mass.end());
  for (int i = n - 1; i >= 0; i--) {
    if (!used[mass[i].second]) {
      dfs1(mass[i].second);
      for (int j = 0; j < comp.size() - 1; j++) {
        unite(comp[j], comp[j + 1]);
      }
      comp.clear();
    }
  }
  vector<int> cnt(n);
  for (int i = 0; i < m; i++) {
    int a1 = vec[i].first;
    int b1 = vec[i].second;
    int a = pred(vec[i].first);
    int b = pred(vec[i].second);
    if (a == b) {
      continue;
    }
    if ((u[a1] + 1) % h == u[b1]) {
      g2[a].insert(b);
      g3[b].insert(a);
    }
    if ((u[b1] + 1) % h == u[a1]) {
      g3[a].insert(b);
      g2[b].insert(a);
    }
  }
  int ans = 1e9;
  for (int i = 0; i < n; i++) {
    if (g2[pred(i)].size() == 0 && _sz[pred(i)] < ans) {
      ans = _sz[pred(i)];
    }
  }
  for (int i = 0; i < n; i++) {
    used[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    if (_sz[pred(i)] == ans && g2[pred(i)].size() == 0) {
      vector<int> ans;
      queue<int> q1;
      q1.push(i);
      used[i] = 1;
      while (q1.size() != 0) {
        int v = q1.front();
        q1.pop();
        ans.push_back(v);
        for (int j = 0; j < g[v].size(); j++) {
          if (!used[g[v][j]]) {
            used[g[v][j]] = 1;
            q1.push(g[v][j]);
          }
        }
      }
      cout << ans.size() << "\n";
      for (int j = 0; j < ans.size(); j++) {
        cout << ans[j] + 1 << " ";
      }
      return 0;
    }
  }
  return 0;
}
