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;
using ll = long long int;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
struct vertex {
  int ind, low, size;
  bool in_stack, vis;
  vi adj;
  vertex() {
    vis = in_stack = false;
    adj = vi();
  }
};
void dfs(int u, vector<vertex>& g, stack<int>& st, vvi& sccs) {
  static int ind = 0;
  if (g[u].vis) return;
  g[u].vis = true;
  g[u].ind = g[u].low = ind++;
  g[u].in_stack = true;
  st.push(u);
  for (int adj : g[u].adj) {
    dfs(adj, g, st, sccs);
    if (g[adj].in_stack) {
      g[u].low = min(g[u].low, g[adj].low);
    }
  }
  if (g[u].ind == g[u].low) {
    int cur;
    vi scc;
    do {
      cur = st.top();
      g[cur].in_stack = false;
      st.pop();
      scc.push_back(cur);
    } while (cur != u);
    sccs.push_back(scc);
  }
}
void dfs2(int u, vector<vertex>& g) {
  if (g[u].vis) return;
  g[u].vis = true;
  for (int adj : g[u].adj) {
    dfs2(adj, g);
    g[u].size += g[adj].size;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, h;
  scanf("%d %d %d", &n, &m, &h);
  vi hs(n);
  for (int& x : hs) {
    scanf("%d", &x);
  }
  vvi c(m, vi(2, 0)), d(n, vi());
  for (int i = 0; i < m; ++i) {
    scanf("%d %d", &c[i][0], &c[i][1]);
    --c[i][0], --c[i][1];
    d[c[i][0]].push_back(i);
    d[c[i][1]].push_back(i);
  }
  vector<vertex> g(n, vertex());
  for (int i = 0; i < n; ++i) {
    for (int a : d[i]) {
      int j = c[a][0] == i ? c[a][1] : c[a][0];
      if ((hs[i] + 1) % h == hs[j]) {
        g[i].adj.push_back(j);
      }
    }
  }
  stack<int> st;
  vi sccid(n);
  vvi sccs;
  int curid = 0;
  vector<vertex> G;
  for (int i = 0; i < n; ++i) {
    if (!g[i].vis) {
      dfs(i, g, st, sccs);
      for (int j = curid; j < int(sccs.size()); ++j) {
        for (int x : sccs[j]) {
          sccid[x] = j;
        }
        G.push_back(vertex());
        G.back().size = int(sccs[j].size());
      }
      curid = int(sccs.size());
    }
  }
  for (int i = 0; i < int(sccs.size()); ++i) {
    for (int x : sccs[i]) {
      for (int adj : g[x].adj) {
        if (i != sccid[adj]) {
          G[i].adj.push_back(sccid[adj]);
        }
      }
    }
  }
  for (int i = 0; i < int(G.size()); ++i) {
    dfs2(i, G);
  }
  vi& ans = sccs[0];
  int size_ans = n + 1;
  for (int i = 0; i < int(G.size()); ++i) {
    if (G[i].size < size_ans) {
      ans = sccs[i];
      size_ans = G[i].size;
    }
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < int(ans.size()); ++i) {
    if (i > 0) {
      printf(" ");
    }
    printf("%d", ans[i] + 1);
  }
  printf("\n");
}
