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 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;
}
