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;
struct node {
  int to, next;
};
const int maxn = 100005;
int f[maxn];
int all;
int n, m, book[maxn], c;
int cnt1, cnt2;
int id[maxn];
node a[maxn];
node b[maxn];
int head1[maxn], head2[maxn];
int q[maxn];
int cd[maxn];
int t[maxn];
vector<int> ans[maxn];
void init() {
  cnt1 = cnt2 = 0;
  for (int i = 1; i <= n; i++) {
    head1[i] = head2[i] = -1;
  }
}
void addedge(int x, int y) {
  cnt1++;
  a[cnt1].to = y;
  a[cnt1].next = head1[x];
  head1[x] = cnt1;
  cnt2++;
  b[cnt2].to = x;
  b[cnt2].next = head2[y];
  head2[y] = cnt2;
}
void dfs1(int x) {
  book[x] = 1;
  for (int i = head1[x]; i != -1; i = a[i].next) {
    if (book[a[i].to] == 0) dfs1(a[i].to);
  }
  q[++c] = x;
}
void dfs2(int x) {
  book[x] = 1;
  id[x] = all;
  ans[all].push_back(x);
  for (int i = head2[x]; i != -1; i = b[i].next) {
    if (book[b[i].to] == 0) dfs2(b[i].to);
  }
}
int main() {
  int sum;
  scanf("%d%d%d", &n, &m, &sum);
  init();
  memset(book, 0, sizeof(book));
  for (int i = 1; i <= n; i++) {
    scanf("%d", &f[i]);
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if ((f[x] + 1) % sum == f[y]) addedge(x, y);
    if ((f[y] + 1) % sum == f[x]) addedge(y, x);
  }
  c = 0;
  for (int i = 1; i <= n; i++) {
    if (book[i] == 0) dfs1(i);
  }
  memset(book, 0, sizeof(book));
  all = 0;
  for (int i = n; i >= 1; i--) {
    if (book[q[i]] == 0) {
      all++;
      dfs2(q[i]);
    }
  }
  memset(cd, 0, sizeof(cd));
  for (int i = 1; i <= n; i++) {
    for (int j = head1[i]; j != -1; j = a[j].next) {
      if (id[i] != id[a[j].to]) {
        cd[a[j].to]++;
      }
    }
  }
  int minm = 1;
  for (int i = 2; i <= all; i++) {
    if (cd[i] <= cd[minm] ||
        (cd[i] == cd[minm] && ans[i].size() <= ans[minm].size())) {
      minm = i;
    }
  }
  int l = ans[minm].size();
  printf("%d\n", l);
  printf("%d", ans[minm][0]);
  for (int i = 1; i < l; i++) {
    printf(" %d", ans[minm][i]);
  }
  printf("\n");
  return 0;
}
