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;
const long long INF = 1e18;
const long double EPS = 1e-7;
vector<set<long long> > g, rg, new_g;
vector<long long> u, comp;
vector<vector<long long> > ver_in_comp;
long long n, m, h, cc = 0;
long long nxt(long long t) {
  if (t == h - 1) {
    return 0;
  }
  return t + 1;
}
void add_edge(long long a, long long b) {
  if (nxt(u[a]) == u[b]) {
    g[a].insert(b);
    rg[b].insert(a);
  }
}
void dfs_order(long long v, vector<bool>& used, vector<long long>& order) {
  used[v] = true;
  for (long long to : g[v]) {
    if (!used[to]) {
      dfs_order(to, used, order);
    }
  }
  order.push_back(v);
}
void dfs_comp(long long v) {
  comp[v] = cc;
  for (long long to : rg[v]) {
    if (comp[to] == -1) {
      dfs_comp(to);
    }
  }
}
void set_comp() {
  comp.resize(n, -1);
  vector<long long> order;
  vector<bool> used(n, false);
  for (long long i = 0; i < n; ++i) {
    if (!used[i]) {
      dfs_order(i, used, order);
    }
  }
  for (long long i = n - 1; i >= 0; --i) {
    if (comp[order[i]] == -1) {
      dfs_comp(order[i]);
      ++cc;
    }
  }
}
void set_new_g() {
  new_g.resize(cc);
  for (long long i = 0; i < n; ++i) {
    for (long long to : g[i]) {
      if (comp[i] != comp[to]) {
        new_g[comp[i]].insert(comp[to]);
      }
    }
  }
}
void set_ver_in_comp() {
  ver_in_comp.resize((signed)new_g.size());
  for (long long i = 0; i < n; ++i) {
    ver_in_comp[comp[i]].push_back(i);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> h;
  g.resize(n);
  rg.resize(n);
  u.resize(n);
  for (long long& it : u) {
    cin >> it;
  }
  for (long long i = 0; i < m; ++i) {
    long long a, b;
    cin >> a >> b;
    --a;
    --b;
    add_edge(a, b);
    add_edge(b, a);
  }
  set_comp();
  set_new_g();
  set_ver_in_comp();
  long long p_ans = -1;
  for (long long i = 0; i < (signed)new_g.size(); ++i) {
    if (new_g[i].empty()) {
      if (p_ans == -1 ||
          (signed)ver_in_comp[i].size() < (signed)ver_in_comp[p_ans].size()) {
        p_ans = i;
      }
    }
  }
  cout << (signed)ver_in_comp[p_ans].size() << endl;
  for (long long it : ver_in_comp[p_ans]) {
    cout << it + 1 << " ";
  }
  cout << endl;
  return 0;
}
