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.util.Scanner;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.function.Consumer;
import java.util.Stack;

public class TimeShift {
    static class Digraph {
        public Digraph(int n) {
            mEdges = new ArrayList<>(n);
            for (int i = 0; i < n; i++) {
                mEdges.add(i, new ArrayList<>());
            }
        }
        
        public void addEdge(int f, int t) {
            mEdges.get(f).add(t);
        }
        
        public Iterable<Integer> adj(int e) {
            return mEdges.get(e);
        }
        
        public int size() {
            return mEdges.size();
        }
        
        public Digraph invert() {
            Digraph result = new Digraph(mEdges.size());
            
            for (int f = 0; f < mEdges.size(); f++) {
                for (int t : mEdges.get(f)) {
                    result.addEdge(t, f);
                }
            }
            
            return result;
        }
        
        private final ArrayList<ArrayList<Integer>> mEdges;
    }
    
    public static void postorder(Digraph d, int start, HashSet<Integer> visited, Consumer<Integer> visit) {
        Stack<Integer> stack = new Stack<>();
        stack.push(start);
        while (!stack.empty()) {
            int v = stack.pop();
            if (visited.contains(v)) {
                visit.accept(v);
                //System.out.println("post: " + v);
                continue;
            }
            visited.add(v);
            //System.out.println("pre: " + v);
            stack.push(v);
            for (int n : d.adj(v)) {
                if (!visited.contains(n)) stack.push(n);
            }
        }
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int h = sc.nextInt();
        
        int updateHour[] = new int[n];
        for (int i = 0; i < n; i++) {
            updateHour[i] = sc.nextInt();
        }
        
        Digraph g = new Digraph(n);
        
        for (int i = 0; i < m; i++) {
            int c1 = sc.nextInt() - 1;
            int c2 = sc.nextInt() - 1;
            
            if ((updateHour[c1] + 1) % h == updateHour[c2]) {
                g.addEdge(c1, c2);
            }
            if ((updateHour[c2] + 1) % h == updateHour[c1]) {
                g.addEdge(c2, c1);
            }
        }
        
        Digraph gr = g.invert();
        final Stack<Integer> order = new Stack<>();
        HashSet<Integer> visited = new HashSet<>();
        for (int i = 0; i < n; i++) {
            if (visited.contains(i)) continue;
            //System.out.println("start: " + i);
            postorder(gr, i, visited, v -> order.push(v));
        }
        
        final int component[] = new int[n];
        int compNum = 0;
        
        visited.clear();
        while (!order.empty()) {
            int i = order.pop();
            if (visited.contains(i)) continue;
            //System.out.println("order: " + i);
            final int compNumCopy = compNum++;
            postorder(g, i, visited, v -> component[v] = compNumCopy);
        }
        
        int compSize[] = new int[compNum];
        for (int i = 0; i < n; i++) {
            //System.out.println("comp: " + i + " -> " + component[i]);
            compSize[component[i]]++;
        }
        
        boolean reachable[] = new boolean[compNum];
        
        for (int i = 0; i < n; i++) {
            for (int j : g.adj(i)) {
                if (component[i] != component[j]) {
                   // System.out.println("reachable: " + i + " -> " + j + ": " + component[j]);
                    reachable[component[j]] = true;
                }
            }
        }
        
        int minComp = -1;
        int minCompSize = Integer.MAX_VALUE;
        for (int i = 0; i < compNum; i++) {
            //System.out.println("size: " + i + " -> " + compSize[i] + ": " + reachable[i]);
            if (!reachable[i] && compSize[i] < minCompSize) {
                minComp = i;
                minCompSize = compSize[i];
            }
        }
        
        System.out.println("" + minCompSize);
        for (int i = 0; i < n; i++) {
            if (component[i] == minComp) {
                System.out.print((i+1) + " ");
            }
        }
        System.out.println();
    }
}