#include <bits/stdc++.h>
using namespace std;
const int N = 100044;
const int INF = 1e9 + 44;
struct data {
  int to, next;
} tu[N * 2];
struct sav {
  int a, b;
} edgsav[N * 2];
int head[N];
int ip;
int dfn[N], low[N];
int sccno[N];
int step;
int scc_cnt;
int n, m, h, u[N];
int ind[N], outd[N];
int edgnum;
void init() {
  ip = 0;
  edgnum = 0;
  memset(head, -1, sizeof(head));
  memset(ind, 0, sizeof(ind));
  memset(outd, 0, sizeof(outd));
}
void add(int u, int v) {
  edgnum++, edgsav[edgnum].a = u, edgsav[edgnum].b = v;
  tu[ip].to = v, tu[ip].next = head[u], head[u] = ip++;
}
vector<int> scc[N];
stack<int> S;
void dfs(int u) {
  dfn[u] = low[u] = ++step;
  S.push(u);
  for (int i = head[u]; i != -1; i = tu[i].next) {
    int v = tu[i].to;
    if (!dfn[v]) {
      dfs(v);
      low[u] = min(low[u], low[v]);
    } else if (!sccno[v])
      low[u] = min(low[u], dfn[v]);
  }
  if (low[u] == dfn[u]) {
    scc_cnt += 1;
    scc[scc_cnt].clear();
    while (1) {
      int x = S.top();
      S.pop();
      if (sccno[x] != scc_cnt) scc[scc_cnt].push_back(x);
      sccno[x] = scc_cnt;
      if (x == u) break;
    }
  }
}
void tarjan(int n) {
  memset(sccno, 0, sizeof(sccno));
  memset(dfn, 0, sizeof(dfn));
  step = scc_cnt = 0;
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) dfs(i);
}
inline int trans(int x) { return (x + 1) % h; }
int main() {
  int a, b;
  init();
  scanf("%d%d%d", &n, &m, &h);
  for (int i = 1; i <= n; i++) scanf("%d", &u[i]);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &a, &b);
    if (trans(u[a]) == u[b]) add(a, b);
    if (trans(u[b]) == u[a]) add(b, a);
  }
  tarjan(n);
  for (int i = 1; i <= edgnum; i++)
    if (sccno[edgsav[i].a] != sccno[edgsav[i].b]) {
      outd[sccno[edgsav[i].a]]++;
      ind[sccno[edgsav[i].b]]++;
    }
  int the, tmp = INF;
  for (int i = 1; i <= scc_cnt; i++)
    if (outd[i] == 0 && scc[i].size() < tmp) the = i, tmp = scc[i].size();
  printf("%d\n", tmp);
  for (int i = 0; i < scc[the].size(); i++) {
    printf("%d", scc[the][i]);
    if (i == scc[the].size() - 1)
      puts("");
    else
      printf(" ");
  }
  return 0;
}
