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 number1, t[300001], t1, x1[300001], y1[300001], number[100001], x[300001],
    y[300001], a[100001], k, num, total1, n, m, total, dfn[300001], low[300001],
    head[300001], edge[300001], next[300001], head1[300001], edge1[300001],
    next1[300001], b[300001];
bool bz[100001];
void insert(int x, int y) {
  total++;
  next[total] = head[x];
  head[x] = total;
  edge[total] = y;
}
void insert1(int x, int y) {
  total1++;
  next1[total] = head1[x];
  head1[x] = total;
  edge1[total] = y;
}
void tarjan_line(int x, int ma) {
  num++;
  dfn[x] = num;
  low[x] = num;
  t1++;
  t[t1] = x;
  for (int i = head[x]; i; i = next[i]) {
    int y = edge[i];
    if (dfn[y] == 0) {
      tarjan_line(y, i);
      if (low[x] > low[y]) {
        low[x] = low[y];
      }
    } else {
      if (low[x] > low[y]) {
        low[x] = low[y];
      }
    }
  }
  if (dfn[x] == low[x] && b[x] == 0) {
    number1++;
    while (t1 > 0) {
      if (t[t1] == x) {
        b[t[t1]] = number1;
        t1--;
        break;
      }
      b[t[t1]] = number1;
      t1--;
    }
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  total = 1;
  int m1 = 0;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x[i], &y[i]);
    if ((a[x[i]] + 1) % k == a[y[i]]) {
      m1++;
      x1[m1] = x[i];
      y1[m1] = y[i];
      insert(x[i], y[i]);
    }
    if ((a[y[i]] + 1) % k == a[x[i]]) {
      m1++;
      x1[m1] = y[i];
      y1[m1] = x[i];
      insert(y[i], x[i]);
    }
  }
  memset(bz, false, sizeof(bz));
  num = 0;
  number1 = 0;
  t1 = 0;
  memset(b, 0, sizeof(b));
  for (int i = 1; i <= n; i++) {
    if (dfn[i] == 0) {
      tarjan_line(i, 0);
    }
  }
  total1 = 0;
  for (int i = 1; i <= m1; i++) {
    if (bz[i] == true) {
      if (b[x1[i]] == b[y1[i]]) continue;
      insert1(b[x1[i]], b[y1[i]]);
    }
  }
  for (int i = 1; i <= n; i++) {
    number[b[i]]++;
  }
  int min = 9999999;
  for (int i = 1; i <= n; i++) {
    if (head1[b[i]] == 0) {
      if (min == 9999999 || number[min] > number[b[i]]) {
        min = b[i];
      }
    }
  }
  int num = 0;
  for (int i = 1; i <= n; i++) {
    if (b[i] == min) {
      num++;
    }
  }
  printf("%d\n", num);
  for (int i = 1; i <= n; i++) {
    if (b[i] == min) {
      printf("%d ", i);
    }
  }
}
