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.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        try {
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
            String[] vals = reader.readLine().split(" ");
            int n = Integer.parseInt(vals[0]);
            int m = Integer.parseInt(vals[1]);
            int h = Integer.parseInt(vals[2]);

            int[] maint = new int[n];
            String[] vals2 = reader.readLine().split(" ");
            for (int i = 0; i < n; i++) {
                maint[i] = Integer.parseInt(vals2[i]);
            }

            int[] d1 = new int[m];
            int[] d2 = new int[m];
            for (int i = 0; i < m; i++) {
                String[] vals3 = reader.readLine().split(" ");
                d1[i] = Integer.parseInt(vals3[0]) - 1;
                d2[i] = Integer.parseInt(vals3[1]) - 1;
            }

            // Stores the lists of data centers that must be shifted if we shift data center i
            ArrayList<HashSet<Integer>> mustShift = new ArrayList<>();
            for(int i = 0; i < n; i++) {
                mustShift.add(new HashSet<>());
            }

            for(int i = 0; i < m; i++) {
                int center1 = d1[i];
                int center2 = d2[i];
                if(maint[center1] == (maint[center2] + 1) % h) {
                    mustShift.get(center2).add(center1);
                }

                if(maint[center2] == (maint[center1] + 1) % h) {
                    mustShift.get(center1).add(center2);
                }
            }

            // If there is a leaf node in the directed graph of data center shifts, just shift that single one.
            // Otherwise, shift all nodes in the smallest leaf node of the condensation of the graph.
            int[] components = stronglyConnectedComponents(mustShift);

            ArrayList<HashSet<Integer>> componentGraph = new ArrayList<>();
            for(int i = 0; i < n; i++) {
                componentGraph.add(new HashSet<>());
            }

            int[] compSizes = new int[n];
            for(int i = 0; i < n; i++) {
                compSizes[components[i]]++;
            }

            for(int i = 0; i < n; i++) {
                for(int v : mustShift.get(i)) {
                    int componentStart = components[i];
                    int componentEnd = components[v];
                    if(componentStart != componentEnd) {
                        componentGraph.get(componentStart).add(componentEnd);
                    }
                }
            }

            int minSize = n + 1;
            int minIndex = -1;
            for(int i = 0; i < n; i++) {
                if(compSizes[i] > 0 && compSizes[i] < minSize && componentGraph.get(i).size() == 0) {
                    minSize = compSizes[i];
                    minIndex = i;
                }
            }

            BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
            writer.write(minSize + "\n");
            for(int i = 0; i < n; i++) {
                if(components[i] == minIndex) {
                    writer.write((i + 1) + " ");
                }
            }
            writer.flush();
        }
        catch(Exception e) {
            System.out.println(e);
        }
    }

    // Kosaraju
    public static int[] stronglyConnectedComponents(ArrayList<HashSet<Integer>> mustShift) {
        int n = mustShift.size();
        int[] components = new int[n];
        for(int i = 0; i < n; i++) {
            components[i] = -1;
        }

        ArrayList<HashSet<Integer>> mustShiftRev = new ArrayList<>();
        for(int i = 0; i < n; i++) {
            mustShiftRev.add(new HashSet<>());
        }

        for(int i = 0; i < n; i++) {
            for(int next : mustShift.get(i)) {
                mustShiftRev.get(next).add(i);
            }
        }

        LinkedList<Integer> l = new LinkedList<>();
        boolean[] visited = new boolean[n];
        for(int i = 0; i < n; i++) {
            visited[i] = false;
        }

        for(int i = 0; i < n; i++) {
            if(!visited[i]) {
                visit(i, visited, l, mustShift);
            }
        }

        for(int v : l) {
            if (components[v] == -1) {
                assign(v, v, components, mustShiftRev);
            }
        }

        return components;
    }

    public static void visit(int current, boolean[] visited, LinkedList<Integer> l, ArrayList<HashSet<Integer>> mustShift) {
        // System.out.println("Called visit for vertex: " + current);
        visited[current] = true;
        for(Integer next : mustShift.get(current)) {
            if(!visited[next]) {
                visit(next, visited, l, mustShift);
            }
        }
        l.addFirst(current);
    }

    public static void assign(int current, int root, int[] components, ArrayList<HashSet<Integer>> mustShiftRev) {
        // System.out.println("Called assign of node " + current + " to component: " + root);
        components[current] = root;
        for(int prev : mustShiftRev.get(current)) {
            if(components[prev] == -1) {
                assign(prev, root, components, mustShiftRev);
            }
        }
    }
}
