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 sy[100001], u[100001], h, a[100001], n, m, dfn[100001], low[100001],
    fir[100001], nex[200001], sto[200001], tot, a1, b1, t, cnt, zhan[100001],
    num[100001], nex1[200001], nmin[100001], ans, fir1[100001], now;
bool p[100001], p1[100001];
bool cmp(int aa, int bb) { return (aa < bb); }
int getmin(int aa, int bb) {
  if (aa < bb)
    return (aa);
  else
    return (bb);
}
void tarjan(int x) {
  int aa = fir[x];
  p[x] = false;
  p1[x] = true;
  cnt++;
  zhan[cnt] = x;
  t++;
  dfn[x] = t;
  low[x] = t;
  while (aa != 0) {
    if (p[sto[aa]]) {
      tarjan(sto[aa]);
      low[x] = getmin(low[x], low[sto[aa]]);
    } else if (p1[sto[aa]])
      low[x] = getmin(low[x], low[sto[aa]]);
    aa = nex[aa];
  }
  if (dfn[x] == low[x]) {
    bool q = true;
    ans++;
    nmin[ans] = zhan[cnt];
    num[ans] = 0;
    while (q) {
      int bb = zhan[cnt];
      sy[bb] = ans;
      if (dfn[bb] == low[bb]) q = false;
      if (bb < nmin[ans]) nmin[ans] = bb;
      num[ans]++;
      nex1[bb] = fir1[ans];
      fir1[ans] = bb;
      cnt--;
      p1[bb] = false;
    }
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &h);
  for (int i = 1; i <= n; i++) {
    p[i] = true;
    p1[i] = false;
  }
  for (int i = 1; i <= n; i++) scanf("%d", &u[i]);
  tot = 0;
  ans = 0;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &a1, &b1);
    if (((u[a1] + 1 - u[b1]) % h) == 0) {
      tot++;
      nex[tot] = fir[a1];
      fir[a1] = tot;
      sto[tot] = b1;
    }
    if (((1 + u[b1] - u[a1]) % h) == 0) {
      tot++;
      nex[tot] = fir[b1];
      fir[b1] = tot;
      sto[tot] = a1;
    }
  }
  cnt = 0;
  t = 0;
  for (int i = 1; i <= n; i++)
    if (p[i]) tarjan(i);
  now = 0;
  num[0] = n + 1;
  for (int i = 1; i <= ans; i++) {
    int dbd = fir1[i];
    bool p = true;
    while (dbd != 0) {
      int aa = fir[dbd];
      while (aa != 0) {
        if (sy[sto[aa]] != sy[dbd]) {
          p = false;
          break;
        }
        aa = nex[aa];
      }
      if (p == false) break;
      dbd = nex1[dbd];
    }
    if (p) {
      if (num[i] < num[now]) now = i;
    }
  }
  int cc = fir1[now];
  tot = 0;
  while (cc != 0) {
    tot++;
    a[tot] = cc;
    cc = nex1[cc];
  }
  sort(a + 1, a + 1 + tot, cmp);
  printf("%d\n", tot);
  for (int i = 1; i <= tot; i++) printf("%d ", a[i]);
}
