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;
vector<int> edg[100007];
vector<int> redg[100007];
stack<int> st;
int vs[100007];
void dfs(int u) {
  vs[u] = 1;
  int i, v;
  for (i = 0; i < edg[u].size(); i++) {
    v = edg[u][i];
    if (vs[v]) continue;
    dfs(v);
  }
  st.push(u);
}
int belogsto[100007];
int compsize[100007];
int id[100007];
set<int> components[100007];
vector<int> cmpNodes[100007];
int scc(int n) {
  int i;
  for (i = 1; i <= n; i++) {
    if (vs[i] == 0) dfs(i);
  }
  memset(vs, 0, sizeof vs);
  int sz = 0;
  while (!st.empty()) {
    int u, v;
    u = st.top();
    st.pop();
    if (vs[u]) continue;
    belogsto[u] = ++sz;
    queue<int> q;
    q.push(u);
    while (!q.empty()) {
      u = q.front();
      q.pop();
      if (vs[u]) continue;
      vs[u] = 1;
      belogsto[u] = sz;
      cmpNodes[sz].push_back(u);
      id[u] = compsize[sz]++;
      for (i = 0; i < redg[u].size(); i++) {
        v = redg[u][i];
        if (vs[v] == 0) q.push(v);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int v : edg[i]) {
      if (belogsto[i] == belogsto[v]) continue;
      components[belogsto[i]].insert(belogsto[v]);
    }
  }
  assert(sz > 0 && sz <= n);
  return sz;
}
int mntnce[100007];
long long dp[100007];
int color[100007];
void loopFinder(int u) {
  color[u] = 1;
  for (int v : components[u]) {
    if (color[v] == 1) {
      printf("loop found!!!\n");
      exit(0);
    }
    if (color[v] == 0) loopFinder(v);
  }
  color[u] = 2;
}
void rc(int u) {
  if (dp[u] != -1) return;
  dp[u] = compsize[u];
  for (int v : components[u]) {
    rc(v);
    dp[u] += dp[v];
  }
}
void print(int u) {
  for (int x : cmpNodes[u]) {
    assert(vs[x] == 0);
    vs[x] = 1;
    printf(" %d", x);
  }
  for (int v : components[u]) {
    print(v);
  }
}
int main() {
  int n, m, h;
  scanf("%d %d %d", &n, &m, &h);
  for (int i = 1; i <= n; i++) scanf("%d", &mntnce[i]);
  while (m--) {
    int c1, c2;
    scanf("%d %d", &c1, &c2);
    if ((mntnce[c1] + 1) % h == mntnce[c2]) {
      edg[c1].push_back(c2);
      redg[c2].push_back(c1);
    }
    if ((mntnce[c2] + 1) % h == mntnce[c1]) {
      edg[c2].push_back(c1);
      redg[c1].push_back(c2);
    }
  }
  int cmp = scc(n);
  for (int i = 1; i <= cmp; i++)
    if (color[i] == 0) loopFinder(i);
  memset(dp, -1, sizeof dp);
  memset(vs, 0, sizeof vs);
  int ans = n + 1, idx = -1;
  for (int i = 1; i <= cmp; i++) {
    rc(i);
    if (dp[i] < ans) {
      ans = dp[i];
      idx = i;
    }
  }
  printf("%d\n", ans);
  memset(vs, 0, sizeof vs);
  print(idx);
  return 0;
}
