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;
struct SCC {
  int n, comp;
  vector<vector<int> > g, gt;
  vector<int> seq, vis;
  void dfs(int u, const vector<vector<int> >& adj) {
    for (int v : adj[u])
      if (vis[v] == -1) {
        vis[v] = comp;
        dfs(v, adj);
      }
    seq.push_back(u);
  }
  SCC() {}
  SCC(int n) : n(n), g(n), gt(n) {}
  void add_edge(int u, int v) {
    g[u].push_back(v);
    gt[v].push_back(u);
  }
  pair<int, vector<int> > find_SCC() {
    vis.assign(n, -1);
    comp = 0;
    for (int i = 0; i < n; i++)
      if (vis[i] == -1) {
        vis[i] = comp;
        dfs(i, g);
      }
    vis.assign(n, -1);
    comp = 0;
    for (int i = n - 1; i >= 0; i--) {
      int u = seq[i];
      if (vis[u] == -1) {
        vis[u] = comp;
        dfs(u, gt);
        comp++;
      }
    }
    return {comp, vis};
  }
  vector<vector<int> > get_dag() {
    map<pair<int, int>, int> mmap;
    vector<vector<int> > dag(comp, vector<int>());
    for (int u = 0; u < n; u++)
      for (int v : g[u]) {
        if (vis[u] == vis[v]) continue;
        if (!mmap.count(pair<int, int>(vis[u], vis[v]))) {
          dag[vis[u]].push_back(vis[v]);
          mmap[pair<int, int>(vis[u], vis[v])] = 1;
        }
      }
    return dag;
  }
};
const int mod = 1000000000 + 7;
int addm(int& a, int b) { return (a += b) < mod ? a : a -= mod; }
template <class T, class U>
bool smin(T& a, U b) {
  return a > b ? (a = b, 1) : 0;
}
template <class T, class U>
bool smax(T& a, U b) {
  return a < b ? (a = b, 1) : 0;
}
int n, m, h;
SCC cc;
int u[100000];
int c[100000][2];
vector<int> outt[100000], comps[100000];
pair<int, vector<int> > scc;
bool inex(int i, int j) {
  i = u[i];
  j = u[j];
  return i + 1 == j || (i + 1 == h && j == 0);
}
bool noout(int i) {
  for (int j = 0; j < comps[i].size(); j++)
    for (int k = 0; k < outt[comps[i][j]].size(); k++)
      if (scc.second[outt[comps[i][j]][k]] != i) return 0;
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> h;
  cc = SCC(n);
  for (int i = 0; i < n; i++) cin >> u[i];
  for (int i = 0; i < m; i++) {
    cin >> c[i][0] >> c[i][1];
    c[i][0]--;
    c[i][1]--;
    if (inex(c[i][0], c[i][1])) {
      cc.add_edge(c[i][0], c[i][1]);
      outt[c[i][0]].push_back(c[i][1]);
    }
    if (inex(c[i][1], c[i][0])) {
      cc.add_edge(c[i][1], c[i][0]);
      outt[c[i][1]].push_back(c[i][0]);
    }
  }
  scc = cc.find_SCC();
  for (int i = 0; i < n; i++) comps[scc.second[i]].push_back(i);
  int mi = -1;
  for (int i = 0; i < scc.first; i++)
    if (noout(i) && (mi == -1 || comps[mi].size() > comps[i].size())) mi = i;
  cout << comps[mi].size() << endl;
  for (int i = 0; i < comps[mi].size(); i++) {
    if (i) cout << ' ';
    cout << comps[mi][i] + 1;
  }
  cout << endl;
}
