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 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C949 solver = new C949();
        solver.solve(1, in, out);
        out.close();
    }

    static class C949 {
        int N;
        int M;
        int H;
        int[] times;

        public void solve(int testNumber, FastScanner s, PrintWriter out) {

            N = s.nextInt();
            M = s.nextInt();
            H = s.nextInt();
            C949.SCC tarzan = new C949.SCC(N);
            times = s.nextIntArray(N);
            ArrayList<int[]> edges = new ArrayList<>();
            for (int i = 0; i < M; i++) {
                int u = s.nextInt() - 1, v = s.nextInt() - 1;
                if ((times[u] + 1) % H == times[v]) {
                    tarzan.add(u, v);
                    edges.add(new int[]{u, v});
                }
                if ((times[v] + 1) % H == times[u]) {
                    tarzan.add(v, u);
                    edges.add(new int[]{v, u});
                }
            }

            int[] scc = tarzan.go();

            ArrayList<ArrayList<Integer>> blocs = new ArrayList<>();
            int mx = 0;
            for (int i : scc)
                mx = Math.max(i, mx);
            mx++;
            for (int i = 0; i < mx; i++)
                blocs.add(new ArrayList<>());
            for (int i = 0; i < N; i++)
                blocs.get(scc[i]).add(i);
            ArrayList<Integer> best = null;
            search:
            for (ArrayList<Integer> group : blocs) {
                // go through each node
                // if we point to any other SCCs, don't take us
                if (best != null && group.size() > best.size()) continue;
                for (int i : group) {
                    for (int j : tarzan.adj[i])
                        if (scc[j] != scc[i]) continue search;
                }
                best = group;
            }

            if (best == null) {
                out.println(N);
                for (int i = 0; i < N; i++)
                    out.print(i + 1 + " ");
                out.println();
                return;
            }

            out.println(best.size());
            for (int i : best)
                out.print(i + 1 + " ");
            out.println();


        }

        static class SCC {
            ArrayList<Integer>[] adj;
            int n;
            int idx;
            int cs;
            boolean[] u;
            int[] pre;
            int[] low;
            int[] map;
            ArrayDeque<Integer> s;

            public SCC(int nn) {
                adj = new ArrayList[n = nn];
                for (int curr = 0; curr < n; ++curr)
                    adj[curr] = new ArrayList<>();
            }

            void add(int v1, int v2) {
                adj[v1].add(v2);
            }

            int[] go() {
                idx = 1;
                cs = 0;
                pre = new int[n];
                low = new int[n];
                map = new int[n];
                u = new boolean[n];
                s = new ArrayDeque<Integer>();
                for (int i = 0; i < n; ++i)
                    if (pre[i] == 0)
                        dfs(i);
                return map;
            }

            void dfs(int v) {
                pre[v] = low[v] = idx++;
                s.push(v);
                u[v] = true;
                for (int to : adj[v]) {
                    if (pre[to] == 0) {
                        dfs(to);
                        low[v] = Math.min(low[v], low[to]);
                    } else if (u[to]) {
                        low[v] = Math.min(low[v], pre[to]);
                    }
                }
                if (low[v] == pre[v]) {
                    int next;
                    do {
                        next = s.pop();
                        u[next] = false;
                        map[next] = cs;
                    } while (next != v);
                    cs++;
                }
            }

        }

    }

    static class FastScanner {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public FastScanner(InputStream stream) {
            this.stream = stream;
        }

        int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public int[] nextIntArray(int N) {
            int[] ret = new int[N];
            for (int i = 0; i < N; i++)
                ret[i] = this.nextInt();
            return ret;
        }

    }
}

