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;
template <typename T>
T gcd(T x, T y) {
  if (x < y) swap(x, y);
  while (y > 0) {
    T f = x % y;
    x = y;
    y = f;
  }
  return x;
}
void exgcd(long long a, long long b, long long &d, long long &x, long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inv(long long a, long long m) {
  long long x, y, d;
  exgcd(a, m, d, x, y);
  return d == 1 ? ((x % m) + m) % m : -1;
}
const int maxn = 1e5 + 7;
const int maxm = 1e5 + 7;
const int maxh = 1e5 + 7;
int n, m, h;
int u[maxh];
set<int> sadj[maxn];
vector<int> adj[maxn];
int vs[maxn];
int inDeg[maxn];
int cnt[maxn];
int S;
int tj_low_link[maxn];
int tj_index[maxn];
int tj_inS[maxn];
int tj_idx;
vector<int> tj_S;
vector<int> tj_res;
void dfs(int u) {
  tj_index[u] = tj_idx;
  tj_low_link[u] = tj_idx;
  tj_idx++;
  tj_S.push_back(u);
  tj_inS[u] = 1;
  for (int v : adj[u]) {
    if (!tj_index[v]) {
      dfs(v);
      tj_low_link[u] = min(tj_low_link[u], tj_low_link[v]);
    } else if (tj_inS[v]) {
      tj_low_link[u] = min(tj_low_link[u], tj_index[v]);
    }
  }
  if (tj_low_link[u] == tj_index[u]) {
    vector<int> rr;
    int w;
    do {
      w = tj_S.back();
      rr.push_back(w);
      tj_S.pop_back();
      tj_inS[w] = false;
    } while (w != u);
    if (tj_res.empty() || rr.size() < tj_res.size()) {
      tj_res = rr;
    }
  }
}
int main(int argc, char *argv[]) {
  std::cin.sync_with_stdio(false);
  std::cin.tie(nullptr);
  cin >> n >> m >> h;
  {
    for (int i = 1; i <= n; i++) cin >> u[i], sadj[i].clear(), adj[i].clear();
    for (int i = 1; i <= m; i++) {
      int c1, c2;
      cin >> c1 >> c2;
      if ((u[c1] + 1) % h == u[c2]) {
        sadj[c1].insert(c2);
      }
      if ((u[c2] + 1) % h == u[c1]) {
        sadj[c2].insert(c1);
      }
    }
    memset(inDeg, 0, sizeof(inDeg));
    for (int u = 1; u <= n; u++) {
      for (int v : sadj[u]) {
        inDeg[v]++;
        adj[u].push_back(v);
      }
    }
    int best0 = -1;
    for (int u = 1; u <= n; u++) {
      if (adj[u].empty()) {
        best0 = u;
        break;
      }
    }
    if (best0 >= 0) {
      cout << 1 << endl << best0 << endl;
    } else {
      memset(vs, 0, sizeof(vs));
      memset(tj_index, 0, sizeof(tj_index));
      memset(tj_low_link, 0, sizeof(tj_low_link));
      memset(tj_inS, 0, sizeof(tj_inS));
      tj_idx = 1;
      for (int u = 1; u <= n; u++) {
        if (!tj_index[u]) {
          dfs(u);
        }
      }
      cout << tj_res.size() << endl;
      for (int x : tj_res) cout << x << " ";
      cout << endl;
    }
  }
  return 0;
}
