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.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.io.InputStream;

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

    static class _949C {
        KosarajuScc scc;
        int maxc = -1;
        int maxcs = -1;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            int h = in.nextInt();

            int[] u = new int[n];
            for (int i = 0; i < n; i++) {
                u[i] = in.nextInt();
            }

            List[] g = new List[n];
            List[] ug = new List[n];

            for (int i = 0; i < n; i++) {
                g[i] = new ArrayList();
                ug[i] = new ArrayList();
            }

            for (int i = 0; i < m; i++) {
                int c1 = in.nextInt() - 1;
                int c2 = in.nextInt() - 1;

                int c1n = (u[c1] + 1) % h;
                int c2n = (u[c2] + 1) % h;

                if (c1n == u[c2]) {
                    g[c1].add(c2);
                    ug[c2].add(c1);
                    ug[c1].add(c2);
                }
                if (c2n == u[c1]) {
                    g[c2].add(c1);
                    ug[c2].add(c1);
                    ug[c1].add(c2);
                }
            }

            scc = new KosarajuScc(n, g);
            scc.generateSccOrder();
            scc.reverseEdge();
            scc.scc();

            int ans = n + 1;
            int ansc = -1;
            boolean[] vis = new boolean[n];
            for (int i = 0; i < n; i++) {
                if (!vis[i]) {
                    maxc = -1;
                    maxcs = -1;
                    dfs(i, vis, ug);
                    if (ans > maxcs) {
                        ans = maxcs;
                        ansc = maxc;
                    }
                }
            }

            out.println(ans);

            for (int i = 0; i < n; i++) {
                if (scc.comp[i] == ansc) {
                    out.print((i + 1) + " ");
                }
            }

        }

        void dfs(int u, boolean[] vis, List[] g) {
            if (scc.comp[u] == maxc) {
                maxcs++;
            }

            if (scc.comp[u] > maxc) {
                maxc = scc.comp[u];
                maxcs = 1;
            }

            vis[u] = true;

            for (int i = 0; i < g[u].size(); i++) {
                int v = (int) g[u].get(i);
                if (!vis[v])
                    dfs(v, vis, g);
            }
        }

        class KosarajuScc {
            int n;
            List[] g;
            ArrayDeque<Integer> sccOrder = new ArrayDeque<>();
            int[] comp;
            List[] rg;

            public KosarajuScc(int n, List[] g) {
                this.n = n;
                this.g = g;
                this.comp = new int[n];
                this.rg = new List[n];
            }

            void generateSccOrder() {
                boolean[] vis = new boolean[2 * n];
                for (int i = 0; i < n; i++) {
                    if (!vis[i])
                        dfs0(i, vis);
                }
            }

            void dfs0(int u, boolean[] vis) {
                vis[u] = true;
                for (Integer v : (List<Integer>) g[u]) {
                    if (!vis[v]) {
                        dfs0(v, vis);
                    }
                }

                sccOrder.addFirst(u);
            }

            void reverseEdge() {
                for (int i = 0; i < n; i++) {
                    rg[i] = new ArrayList<>();
                }

                for (int i = 0; i < n; i++) {
                    for (Integer v : (List<Integer>) g[i]) {
                        rg[v].add(i);
                    }
                }
            }

            void scc() {
                boolean[] vis = new boolean[n];
                int cn = 0;
                for (Integer v : sccOrder) {

                    if (!vis[v]) {
                        dfs1(v, rg, cn, vis);
                        cn++;
                    }
                }
            }

            void dfs1(int u, List[] g, int cn, boolean[] vis) {
                comp[u] = cn;
                vis[u] = true;

                for (int j = 0; j < g[u].size(); j++) {
                    int v = (int) g[u].get(j);

                    if (!vis[v]) {
                        dfs1(v, g, cn, vis);
                    }
                }
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

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

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

        public 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++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }
}

