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>
#define reg register
#define ll long long
#define ull unsigned long long
using namespace std;
const int MAXN = 1e6 + 10;
int n, m, h, E, head[MAXN], nxt[MAXN << 1], pnt[MAXN << 1], a[MAXN], frm[MAXN << 1];
int stk[MAXN], top = 0, dfn[MAXN], dfc = 0, low[MAXN], scc[MAXN], sz[MAXN], tot = 0, deg[MAXN];
bool vis[MAXN];
void clear() {
  E = 0, memset(head, -1, sizeof(head));
  memset(dfn, 0, sizeof(dfn)), memset(deg, 0, sizeof(deg));
  memset(sz, 0, sizeof(sz)), memset(scc, 0, sizeof(scc)), memset(vis, 0, sizeof(vis));
  top = 0, dfc = 0, tot = 0;
}
void addedge(reg int x, reg int y) {
  nxt[E] = head[x], frm[E] = x, pnt[E] = y, head[x] = E++;
}
/* void tarjan(reg int u) {
  low[u] = dfn[u] = ++dfc;
  vis[u] = 1, stk[++top] = u;
  for(reg int i = head[u]; i != -1; i = nxt[i]) {
    int v = pnt[i];
    if(!dfn[v]) {
      tarjan(v);
      low[u] = min(low[u], low[v]);
    } else {
      if(vis[v]) low[u] = min(low[u], dfn[v]);
    }
  }
  if(low[u] == dfn[u]) {
    int tmp;
    ++tot;
    while(u != tmp) {
      tmp = stk[top--];
      scc[tmp] = tot, vis[tmp] = 0, ++sz[tot];
    }
  }
}*/
void tarjan(reg int x) {
	low[x] = dfn[x] = ++dfc, vis[x] = 1, stk[++top] = x;
	for(reg int i = head[x]; ~i; i = nxt[i]) {
		int y = pnt[i];
		if(!dfn[y]) {
			tarjan(y);
			low[x] = min(low[x], low[y]);
		}
		else {
			if(vis[y]) low[x] = min(low[x], dfn[y]);
		}
	}
	if(low[x] == dfn[x]) {
		int tmp;
		tot++;
		for( ; ;) {
			tmp = stk[top--];
			scc[tmp] = tot;
			vis[tmp] = 0;
			sz[tot]++;
			if(tmp == x) return ;
		}
	}
}
void work() {
  scanf("%d%d%d", &n, &m, &h), clear();
  for(reg int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for(reg int i = 1; i <= m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    if((a[x] + 1) % h == a[y]) addedge(x, y);
    if((a[y] + 1) % h == a[x]) addedge(y, x);
  }
  for(reg int i = 1; i <= n; ++i) {
    if(!dfn[i]) tarjan(i);
  }
  for(reg int i = 1; i <= E; ++i) {
    int u = scc[frm[i]], v = scc[pnt[i]];
    if(u != v) ++deg[u];
  }
  int ans = 0;
  sz[0] = 0x3f3f3f3f;
  for(reg int i = 1; i <= tot; ++i) if(!deg[i]) {
    if(sz[i] < sz[ans]) ans = i;
  }
  printf("%d\n", sz[ans]);
  for(reg int i = 1; i <= n; ++i) if(scc[i] == ans) printf("%d ", i);
  puts("");
}
int main() {
  int _ = 1;
  // scanf("%d", &_);
  while(_--) {
    work();
  }
  return 0;
}
