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;
int d[100005];
vector<int> e[100005];
pair<int, int> f[100005];
int n, m, h;
bool v[100005] = {0};
bool v2[100005] = {0};
bool v3[100005] = {0};
stack<pair<int, int> > q;
stack<int> rs;
bool r[100005] = {0};
vector<int> p[100005];
vector<int> gr;
vector<int> sinks;
vector<vector<int> > g2;
int wow[100005] = {0};
vector<int> things;
bool g(int a, int b) { return (d[a] + 1) % h == d[b]; }
int main() {
  cin >> n >> m >> h;
  for (int i = 1; i <= n; i++) {
    cin >> d[i];
  }
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    f[i] = make_pair(min(a, b), max(a, b));
  }
  sort(f, f + m);
  if (g(f[0].first, f[0].second)) e[f[0].first].push_back(f[0].second);
  if (g(f[0].second, f[0].first)) e[f[0].second].push_back(f[0].first);
  for (int i = 1; i < m; i++) {
    if (f[i].first == f[i - 1].first && f[i].second == f[i - 1].second)
      continue;
    if (g(f[i].first, f[i].second)) e[f[i].first].push_back(f[i].second);
    if (g(f[i].second, f[i].first)) e[f[i].second].push_back(f[i].first);
  }
  if (h != 2) {
    int ss = 10000000;
    int sp = -1;
    for (int i = 1; i <= n; i++) {
      if (v[i]) continue;
      q.push(make_pair(i, 1));
      while (!q.empty()) {
        int a = q.top().first;
        int b = q.top().second;
        q.pop();
        v[a] = true;
        rs.push(a);
        r[a] = true;
        int np = 0;
        int asdf = 0;
        for (int i = 0; i < e[a].size(); i++) {
          if (!v[e[a][i]]) {
            q.push(make_pair(e[a][i], b + 1));
            np++;
            asdf++;
          } else if (!r[e[a][i]]) {
            np++;
          }
        }
        if (np == 0) {
          sinks.push_back(a);
        }
        if (asdf == 0) {
          while (!rs.empty()) {
            int aa = rs.top();
            rs.pop();
            r[aa] = false;
          }
        }
      }
    }
    for (int i = 0; i < sinks.size(); i++) {
      int aa = sinks[i];
      q.push(make_pair(aa, 1));
      while (!q.empty()) {
        int a = q.top().first;
        int b = q.top().second;
        q.pop();
        v3[a] = true;
        int np = 0;
        for (int i = 0; i < e[a].size(); i++) {
          if (!v3[e[a][i]]) {
            q.push(make_pair(e[a][i], b + 1));
            np++;
          }
        }
        if (np == 0 && b < ss) {
          ss = b;
          sp = aa;
        }
      }
    }
    q.push(make_pair(sp, 1));
    while (!q.empty()) {
      int a = q.top().first;
      int b = q.top().second;
      gr.push_back(a);
      q.pop();
      v2[a] = true;
      int np = 0;
      for (int i = 0; i < e[a].size(); i++) {
        if (!v2[e[a][i]]) {
          q.push(make_pair(e[a][i], b + 1));
        }
      }
    }
    cout << ss << endl;
    for (int i = 0; i < gr.size(); i++) {
      cout << gr[i] << " ";
    }
    cout << endl;
  } else {
    int ss = 10000000;
    int sp = -1;
    for (int i = 1; i <= n; i++) {
      if (v[i]) continue;
      q.push(make_pair(i, 1));
      int ct = 0;
      while (!q.empty()) {
        int a = q.top().first;
        int b = q.top().second;
        q.pop();
        ct++;
        v[a] = true;
        rs.push(a);
        r[a] = true;
        for (int i = 0; i < e[a].size(); i++) {
          if (!v[e[a][i]]) {
            q.push(make_pair(e[a][i], b + 1));
          }
        }
      }
      if (ct < ss) {
        ss = ct;
        sp = i;
        things.clear();
        while (!rs.empty()) {
          int aa = rs.top();
          rs.pop();
          things.push_back(aa);
        }
      }
      while (!rs.empty()) {
        rs.pop();
      }
    }
    cout << ss << endl;
    for (int i = 0; i < things.size(); i++) {
      cout << things[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
