#include <bits/stdc++.h>
using namespace std;
long long int n = 0, m = 0, h = 0;
vector<vector<long long int>> data, data_t;
vector<long long int> u;
vector<bool> used;
vector<long long int> order;
vector<long long int> components;
long long int Mod(long long int a, long long int b) { return (a % b + b) % b; }
long long int Add(long long int a, long long int b) { return Mod(a + b, h); }
void DFS1(long long int v) {
  used[v] = true;
  for (auto it : data[v])
    if (!used[it]) DFS1(it);
  order.push_back(v);
}
void DFS2(long long int v, long long int color) {
  used[v] = true;
  components[v] = color;
  for (auto it : data_t[v])
    if (!used[it]) DFS2(it, color);
}
void DFS3(vector<vector<long long int>>& next, vector<bool>& check,
          vector<long long int>& sz, vector<long long int>& dp,
          long long int v) {
  check[v] = true;
  for (auto it : next[v])
    if (!check[it]) DFS3(next, check, sz, dp, it);
  dp[v] = sz[v];
  for (auto it : next[v]) dp[v] += dp[it];
}
void DFS4(vector<vector<long long int>>& next, vector<bool>& check,
          vector<long long int>& sz, vector<long long int>& dp,
          set<long long int>& answer, long long int v) {
  check[v] = true;
  answer.insert(v);
  for (auto it : next[v])
    if (!check[it]) DFS4(next, check, sz, dp, answer, it);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n >> m >> h;
  data.resize(n);
  data_t.resize(n);
  u.resize(n);
  used.resize(n);
  components.resize(n);
  for (auto& it : u) cin >> it;
  for (long long int i = 0; i < m; i++) {
    long long int x = 0, y = 0;
    cin >> x >> y;
    x--, y--;
    if (Add(u[x], 1) == u[y]) {
      data[x].push_back(y);
      data_t[y].push_back(x);
    }
    if (Add(u[y], 1) == u[x]) {
      data[y].push_back(x);
      data_t[x].push_back(y);
    }
  }
  for (long long int i = 0; i < n; i++)
    if (!used[i]) DFS1(i);
  reverse(order.begin(), order.end());
  used.assign(n, false);
  long long int color = 0;
  for (long long int i = 0; i < order.size(); i++) {
    if (!used[order[i]]) {
      DFS2(order[i], color);
      color++;
    }
  }
  vector<set<long long int>> next(color);
  for (long long int i = 0; i < data.size(); i++) {
    for (auto it : data[i]) {
      if (components[i] != components[it])
        next[components[i]].insert(components[it]);
    }
  }
  vector<vector<long long int>> graph(color);
  for (long long int i = 0; i < next.size(); i++) {
    for (auto it : next[i]) graph[i].push_back(it);
  }
  vector<long long int> sz(color);
  for (auto it : components) sz[it]++;
  vector<bool> check(color);
  vector<long long int> dp(color, -1);
  for (long long int i = 0; i < color; i++) {
    if (!check[i]) DFS3(graph, check, sz, dp, i);
  }
  long long int index = 0;
  for (long long int i = 1; i < dp.size(); i++) {
    if (dp[i] < dp[index]) index = i;
  }
  check.assign(color, false);
  set<long long int> answer;
  DFS4(graph, check, sz, dp, answer, index);
  cout << dp[index] << '\n';
  for (long long int i = 0; i < components.size(); i++) {
    if (answer.count(components[i]) > 0) cout << i + 1 << ' ';
  }
  return 0;
}
