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 = 1e5 + 10;
int map[N * 20], t[N * 20], last[N], len, n, m, h;
int Map[N * 20], T[N * 20], La[N], bz[N], du[N], Ln;
int a[N], size[N], low[N], d[N], ans[N], bj[N];
int od[N];
void Add(int x, int y) {
  Map[++Ln] = y;
  T[Ln] = La[x];
  La[x] = Ln;
}
void add(int x, int y) {
  map[++len] = y;
  t[len] = last[x];
  last[x] = len;
  du[y]++;
  od[x]++;
}
void dfs(int x, int de) {
  bz[x] = true;
  size[x] = 1;
  d[x] = de;
  low[x] = x;
  for (int c = last[x]; c; c = t[c]) {
    int y = map[c];
    if (bz[y]) {
      if (d[y] < d[low[x]]) low[x] = y;
      continue;
    }
    dfs(y, de + 1);
    size[x] += size[y];
    if (d[low[y]] < d[low[x]]) low[x] = low[y];
  }
}
void Dfs(int x) {
  ans[x] = 1;
  bj[x] = true;
  int o = 0;
  for (int c = last[x]; c; c = t[c]) {
    int y = map[c];
    if (bj[y]) continue;
    Dfs(y);
    ans[x] += ans[y];
  }
}
void gt(int x) {
  printf("%d ", x);
  bz[x] = true;
  for (int c = last[x]; c; c = t[c]) {
    int y = map[c];
    if (bz[y]) continue;
    gt(y);
  }
}
int dt[N];
int main() {
  scanf("%d%d%d", &n, &m, &h);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    Add(x, y);
    Add(y, x);
  }
  for (int i = 1; i <= n; i++)
    for (int c = La[i]; c; c = T[c])
      if (a[Map[c]] == (a[i] + 1) % h) add(i, Map[c]);
  int en = 0;
  for (int i = 1; i <= n; i++) {
    if (!du[i]) dt[++en] = i, bj[i] = true;
  }
  for (int st = 1; st <= en; st++) {
    int x = dt[st];
    for (int c = last[x]; c; c = t[c]) {
      int y = map[c];
      du[y]--;
      if (!du[y]) {
        bj[y] = true;
        dt[++en] = y;
      }
    }
  }
  int Ans = 1 << 30;
  for (int i = 1; i <= n; i++) {
    if (!od[i]) {
      printf("%d\n%d", 1, i);
      return 0;
    }
  }
  int mn = 0;
  for (int i = 1; i <= n; i++) {
    if (!bj[i]) {
      Dfs(i);
      if (ans[i] < Ans) mn = i;
      Ans = min(Ans, ans[i]);
    }
  }
  memset(bz, 0, sizeof(bz));
  printf("%d\n", Ans);
  gt(mn);
  return 0;
}
