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.HashSet;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
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;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DataCenterMaintenance solver = new DataCenterMaintenance();
        solver.solve(1, in, out);
        out.close();
    }

    static class DataCenterMaintenance {
        HashSet<Integer>[] edge;
        boolean[] visited;
        int[] compId;
        ArrayList<Integer> topSort = new ArrayList<>();
        ArrayList<Integer>[] compAdjList;
        ArrayList<Integer>[] adjList;
        ArrayList<Integer>[] adjListR;
        ArrayList<Integer>[] components;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt();
            int M = in.nextInt();
            int H = in.nextInt();
            int[] p = new int[N];
            for (int i = 0; i < N; i++) {
                p[i] = in.nextInt();
            }
            edge = new HashSet[N];
            for (int i = 0; i < N; i++) {
                edge[i] = new HashSet<>();
            }
//        for (int i = 0; i < N; i++) {
//            up[i] = i;
//        }
            for (int i = 0; i < M; i++) {
                int u1 = in.nextInt() - 1;
                int u2 = in.nextInt() - 1;
                if (p[u2] < p[u1]) {
                    int temp = u1;
                    u1 = u2;
                    u2 = temp;
                }
                if (H == 2) {
                    edge[u2].add(u1);
                    edge[u1].add(u2);
                } else {
                    if (p[u1] == 0 && p[u2] == H - 1) {
                        edge[u2].add(u1);
                    } else if (p[u2] - p[u1] == 1) {
                        edge[u1].add(u2);
                    }
                }
            }
            visited = new boolean[N];
            init(edge);
            int min = 100000000;
            ArrayList<Integer> res = new ArrayList<>();
            for (int i = 0; i < N; i++) {
                if (compAdjList[compId[i]].size() == 0 && components[compId[i]].size() < min) {
                    res = components[compId[i]];
                    min = res.size();
                }
            }
            for (int i = 0; i < N; i++) {
                if (edge[i].size() == 0) {
                    out.println(1);
                    out.println(i + 1);
                    return;
                }
            }
            print(out, res);
        }

        void print(PrintWriter out, ArrayList<Integer> arr) {
            out.println(arr.size());
            for (int j : arr) {
                out.println(j + 1);
            }
        }

        public void dfs1(int v) {
            if (!visited[v]) {
                visited[v] = true;
                for (int next : adjList[v]) {
                    dfs1(next);
                }
                topSort.add(v);
            }
        }

        public void dfs2(int v, int comp) {
            if (!visited[v]) {
                visited[v] = true;
                compId[v] = comp;
                components[comp].add(v);
                for (int c : adjListR[v]) {
                    dfs2(c, comp);
                }
            } else if (compId[v] != comp) {
                compAdjList[compId[v]].add(comp); // since we traversing reverse graph, if comp leads to compId[v], then in real graph it is the other way around
            }
        }

        void init(HashSet<Integer>[] edges) {
            int N = edges.length;
            adjList = new ArrayList[N];
            adjListR = new ArrayList[N];
            components = new ArrayList[N];
            compAdjList = new ArrayList[N];
            compId = new int[N];
            for (int i = 0; i < N; i++) {
                components[i] = new ArrayList<>();
                adjListR[i] = new ArrayList<>();
                adjList[i] = new ArrayList<>();
                compAdjList[i] = new ArrayList<>();
            }
            for (int i = 0; i < N; i++) {
                for (int e : edges[i]) {
                    adjList[i].add(e);
                    adjListR[e].add(i);
                }
            }
            for (int i = 0; i < N; i++) {
                dfs1(i);
            }
            visited = new boolean[N];
            int comp = 0;
            for (int j = N - 1; j >= 0; j--) {
                if (!visited[topSort.get(j)]) {
                    dfs2(topSort.get(j), comp++);
                }
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

