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;
int n, m, h, a[200010], dfn[200010], low[200010], head[200010], sum,
    cnt = 1, t, bel[200010], ans = 0x3f3f3f3f, sze[200010], qwq;
bool instk[200010], vis[200010], tried[200010];
stack<int> stk;
vector<int> go[200010];
struct hhh {
  int to, next;
} edge[4 * 100010];
int read() {
  int ans = 0, fu = 1;
  char j = getchar();
  for (; j < '0' || j > '9'; j = getchar())
    if (j == '-') fu = -1;
  for (; j >= '0' && j <= '9'; j = getchar()) ans *= 10, ans += j - '0';
  return ans * fu;
}
void add(int u, int v) {
  edge[cnt].to = v;
  edge[cnt].next = head[u];
  head[u] = cnt++;
}
void Tarjan(int x) {
  dfn[x] = low[x] = ++t;
  stk.push(x);
  instk[x] = 1;
  for (int i = head[x], v; i; i = edge[i].next) {
    v = edge[i].to;
    if (!dfn[v]) {
      Tarjan(v);
      low[x] = min(low[x], low[v]);
    } else if (instk[v])
      low[x] = min(low[x], dfn[v]);
  }
  if (low[x] == dfn[x]) {
    sum++;
    int t;
    do {
      t = stk.top();
      bel[t] = sum;
      if (t > n) sze[sum]++;
      stk.pop();
      instk[t] = 0;
    } while (t != x);
  }
}
void insert(int u, int v) { go[u].push_back(v); }
void dfs(int x) {
  vis[x] = 1;
  tried[x] = 1;
  int s = go[x].size();
  for (int i = 0; i < s; i++)
    if (tried[go[x][i]])
      continue;
    else if (vis[go[x][i]])
      sze[x] += sze[go[x][i]];
    else {
      dfs(go[x][i]);
      sze[x] += sze[go[x][i]];
    }
}
int main() {
  n = read();
  m = read();
  h = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  int u, v;
  while (m--) {
    u = read();
    v = read();
    if ((a[u] + 1) % h == a[v]) {
      add(u + n, v + n);
      add(v, u);
    }
    if ((a[v] + 1) % h == a[u]) {
      add(v + n, u + n);
      add(u, v);
    }
    if (a[u] == a[v]) {
      add(u, v + n);
      add(v, u + n);
      add(v + n, u);
      add(u + n, v);
    }
  }
  for (int i = 1; i <= n + n; i++)
    if (!dfn[i]) Tarjan(i);
  for (int i = 1; i <= n + n; i++) {
    for (int j = head[i]; j; j = edge[j].next) insert(bel[i], bel[edge[j].to]);
  }
  for (int i = 1; i <= sum; i++)
    if (!vis[i]) dfs(i);
  for (int i = 1; i <= sum; i++)
    if (sze[i] && sze[i] < ans) ans = sze[i], qwq = i;
  printf("%d\n", ans);
  memset(vis, 0, sizeof(vis));
  dfs(qwq);
  for (int i = 1; i <= n; i++)
    if (vis[bel[i + n]]) printf("%d ", i);
  return 0;
}
