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;
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;
}
