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;
int n, m, h, counter = 0;
vector<int> U, num, dfs_num, dfs_low, vis1, vis2;
vector<vector<int> > adj, adj2, scc;
stack<int> st;
void tarjanSCC(int v) {
  dfs_num[v] = dfs_low[v] = counter++;
  st.push(v);
  vis1[v] = vis2[v] = 1;
  for (int i = 0; i < adj[v].size(); ++i) {
    if (dfs_num[adj[v][i]] == -1) tarjanSCC(adj[v][i]);
    if (vis1[adj[v][i]]) dfs_low[v] = min(dfs_low[v], dfs_low[adj[v][i]]);
  }
  if (dfs_low[v] == dfs_num[v]) {
    vector<int> aux;
    while (true) {
      int v2 = st.top();
      st.pop();
      aux.push_back(v2);
      vis1[v2] = 0;
      if (v == v2) break;
    }
    scc.push_back(aux);
  }
}
void solve() {
  dfs_num = dfs_low = vector<int>(n, -1);
  vis1 = vis2 = vector<int>(n);
  for (int i = 0; i < n; ++i) {
    if (!vis2[i]) tarjanSCC(i);
  }
  vector<int> ind(n);
  for (int i = 0; i < scc.size(); ++i) {
    for (int j = 0; j < scc[i].size(); ++j) {
      ind[scc[i][j]] = i;
    }
  }
  adj2 = vector<vector<int> >(scc.size());
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < adj[i].size(); ++j) {
      if (ind[adj[i][j]] != ind[i]) {
        adj2[ind[i]].push_back(ind[adj[i][j]]);
      }
    }
  }
}
vector<int> ANS, vis;
void dfs(int v) {
  if (ANS[v] != -1) return;
  vis[v] = 1;
  int ans = scc[v].size();
  for (int i = 0; i < adj2[v].size(); ++i) {
    int to = adj2[v][i];
    if (vis[to] != 1) dfs(to);
    ans += ANS[to];
  }
  ANS[v] = ans;
}
void findsol(int mn) {
  vector<int> ans;
  for (int i = 0; i < n; ++i) {
    if (ANS[i] == mn) {
      int cur = i, target = mn - scc[i].size();
      while (true) {
        for (int j = 0; j < scc[cur].size(); ++j) {
          ans.push_back(scc[cur][j]);
        }
        bool flag = false;
        for (int j = 0; j < adj2[cur].size(); ++j) {
          int to = adj2[cur][j];
          if (ANS[to] == target) {
            target -= scc[to].size();
            cur = to;
            flag = true;
            break;
          }
        }
        if (!flag || target == 0) break;
      }
      break;
    }
  }
  for (int i = 0; i < ans.size(); ++i) {
    cout << ans[i] + 1 << " ";
  }
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> h;
  U = vector<int>(n);
  adj = vector<vector<int> >(n);
  for (int i = 0; i < n; ++i) cin >> U[i];
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    if ((U[a] + 1) % h == U[b]) adj[a].push_back(b);
    if ((U[b] + 1) % h == U[a]) adj[b].push_back(a);
  }
  solve();
  vis = ANS = vector<int>(adj2.size(), -1);
  int mn = 1e9;
  for (int i = 0; i < adj2.size(); ++i) {
    if (vis[i] == -1) dfs(i);
    mn = min(mn, ANS[i]);
  }
  if (mn < 0) {
  }
  cout << mn << "\n";
  findsol(mn);
  return 0;
}
