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;
const int inf = 0x3f3f3f3f;
const long long llinf = 0x3f3f3f3f3f3f3f3f;
template <typename INint>
inline void IN(INint &first) {
  first = 0;
  int f = 1;
  char c;
  cin.get(c);
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    cin.get(c);
  }
  while (c >= '0' && c <= '9') {
    first = first * 10 + c - '0';
    cin.get(c);
  }
  first *= f;
}
template <typename INint>
inline void OUT(INint first) {
  if (first > 9) OUT(first / 10);
  cout.put(first % 10 + '0');
}
const int maxn = int(1e5 + 5);
struct tj {
  vector<int> G[maxn];
  int DFN[maxn], low[maxn];
  bool inStack[maxn];
  stack<int> S;
  int belong[maxn], num, index;
  void Tarjan(int u) {
    DFN[u] = low[u] = ++index;
    inStack[u] = true;
    S.push(u);
    for (auto v : G[u]) {
      if (!DFN[v]) {
        Tarjan(v);
        low[u] = min(low[u], low[v]);
      } else if (inStack[v])
        low[u] = min(low[u], DFN[v]);
    }
    if (DFN[u] == low[u]) {
      ++num;
      int v;
      do {
        v = S.top();
        S.pop();
        belong[v] = num;
        inStack[v] = 0;
      } while (v != u);
    }
  }
  void SCC(int n) {
    for (int i = 1; i <= n; i++)
      if (!DFN[i]) Tarjan(i);
  }
  vector<int> E[maxn];
  int value[maxn];
  int ans[maxn];
  void abc(int n) {
    for (int i = 1; i <= int(n); i++) ++value[belong[i]];
    for (int i = 1; i <= int(n); i++) {
      for (auto to : G[i]) {
        if (belong[i] != belong[to]) {
          E[belong[i]].push_back(belong[to]);
        }
      }
    }
    for (int i = 1; i <= int(num); i++) {
      sort(E[i].begin(), E[i].end());
      E[i].erase(unique(E[i].begin(), E[i].end()), E[i].end());
    }
  }
  int dfs(int first) {
    int &ret = ans[first];
    if (ret == 0) {
      ret = value[first];
      for (auto to : E[first]) {
        ret += dfs(to);
      }
    }
    return ret;
  }
  int gans(int n) {
    abc(n);
    for (int i = 1; i <= int(num); i++) dfs(i);
    return min_element(ans + 1, ans + 1 + num) - ans;
  }
} tj1;
int n, m, h;
int a[maxn];
vector<int> G[maxn];
vector<int> E[maxn];
inline int nxt(int first) { return (first + 1) % h; }
int main() {
  int T(1), times(0);
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  while (++times, T--) {
    cin >> n >> m >> h;
    for (int i = 1; i <= int(n); i++) cin >> a[i];
    for (int i = 1; i <= int(m); i++) {
      int f, t;
      cin >> f >> t;
      G[f].push_back(t);
      G[t].push_back(f);
    }
    for (int i = 1; i <= int(n); i++) {
      for (auto to : G[i]) {
        if (a[to] == nxt(a[i])) {
          tj1.G[i].push_back(to);
        }
      }
    }
    tj1.SCC(n);
    int id = tj1.gans(n);
    vector<int> aans;
    for (int i = 1; i <= int(n); i++)
      if (tj1.belong[i] == id) aans.push_back(i);
    cout << aans.size() << endl;
    for (int i = 0; i < int(aans.size()); i++) {
      if (i) cout << ' ';
      cout << aans[i];
    }
    cout << endl;
  }
  return 0;
}
