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 long long N = 1e5 + 10, INF = 1e17;
long long n, m, h, c[N], num[N], low[N], d[N], p[N], number_of_component, a[N],
    res;
vector<long long> vertex[N], TPLT[N], vertex1[N];
stack<long long> s, DS;
bool kt[N];
void read(long long &x) {
  x = 0;
  char c = getchar();
  while (c > '9' || c < '0') c = getchar();
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - 48;
    c = getchar();
  }
}
void tarjan(long long x) {
  s.push(x);
  long long nbase = 1;
  low[x] = num[x] = nbase;
  DS.push(x);
  while (!s.empty()) {
    long long u = s.top();
    if (!vertex[u].empty() && d[u] < vertex[u].size()) {
      long long v = vertex[u][d[u]];
      if (!num[v]) {
        nbase++;
        num[v] = low[v] = nbase;
        p[v] = u;
        s.push(v);
        DS.push(v);
      } else if (!kt[v]) {
        low[u] = min(low[u], num[v]);
      }
      d[u]++;
    } else {
      s.pop();
      low[p[u]] = min(low[p[u]], low[u]);
      if (low[u] >= num[u]) {
        number_of_component++;
        while (DS.top() != u) {
          TPLT[number_of_component].push_back(DS.top());
          a[DS.top()] = number_of_component;
          kt[DS.top()] = 1;
          DS.pop();
        }
        DS.pop();
        kt[u] = 1;
        a[u] = number_of_component;
        TPLT[number_of_component].push_back(u);
      }
    }
  }
}
void Build_DAG() {
  for (long long i = 1; i <= n; i++) {
    for (long long j : vertex[i])
      if (a[j] != a[i]) {
        vertex1[i].push_back(j);
      }
  }
}
void DFS(long long x) {
  s.push(x);
  kt[x] = 0;
  while (!s.empty()) {
    long long u = s.top();
    if (!vertex1[u].empty() && d[u] < vertex1[u].size()) {
      long long v = vertex1[u][d[u]];
      if (kt[v]) {
        s.push(v);
        kt[v] = 0;
      }
      d[u]++;
    } else {
      s.pop();
      if (vertex1[u].empty() &&
          (res == 0 || TPLT[res].size() > TPLT[a[u]].size()))
        res = a[u];
    }
  }
}
void Find_ans() {
  for (long long i = 1; i <= n; i++) d[i] = 0;
  for (long long i = 1; i <= n; i++)
    if (kt[i]) DFS(i);
}
void solve() {
  for (long long i = 1; i <= n; i++)
    if (!num[i]) tarjan(i);
  Build_DAG();
  Find_ans();
  cout << TPLT[res].size() << '\n';
  for (long long i : TPLT[res]) cout << i << ' ';
}
long long tinh(long long x) { return (x + 1) % h; }
int main() {
  read(n);
  read(m);
  read(h);
  for (long long i = 1; i <= n; i++) read(c[i]);
  long long u, v;
  for (long long i = 1; i <= m; i++) {
    read(u);
    read(v);
    if (tinh(c[u]) == c[v]) vertex[u].push_back(v);
    if (tinh(c[v]) == c[u]) vertex[v].push_back(u);
  }
  solve();
}
