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.awt.List;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Stack;
import java.util.StringTokenizer;

public class E {

	
	static int N;
	static int M;
	static int H;
	static center ar[];
	static int cli[][];
	static ArrayList<Integer> adj[];
	
	public static void main(String[] args) {
		FastScanner in = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		N = in.nextInt();
		M = in.nextInt();
		H = in.nextInt();
		ar = new center[N];
		cli = new int[2][M];
		for(int i = 0; i < N; i++) ar[i] = new center();
		
		for(int i = 0; i < N; i++) {
			ar[i].hour = in.nextInt();
		}
		for(int i = 0; i < M; i++) {
			int p1 = in.nextInt()-1;
			int p2 = in.nextInt()-1;
			cli[0][i]=p1;
			cli[1][i]=p2;			
			ar[p1].clients.add(i);
			ar[p2].clients.add(i);
		}
		boolean hasOut[] = new boolean[N];
		adj = new ArrayList[N];
		for(int i = 0; i < N; i++) adj[i] = new ArrayList<Integer>();
		
		for(int i = 0; i < N; i++) {
			int nextHour = ar[i].hour+1;
			if(nextHour==H)nextHour=0;
			
			for(Integer c : ar[i].clients) {
				int other = cli[0][c] != i ? cli[0][c] : cli[1][c];
				if(ar[other].hour == nextHour) {
					adj[i].add(other);
					hasOut[i] = true;
				}
			}
		}
		
		for(int i = 0; i < N; i++) {
			if(hasOut[i]== false) {
				out.println(1+"\n"+(i+1));
				out.close();
				return;
			}
		}
		
		tarjan t = new tarjan();
		ArrayList<ArrayList<Integer>> scc = t.getSCComponents(adj);

		int best = Integer.MAX_VALUE;
		ArrayList<Integer> res = new ArrayList<Integer>();
		for(ArrayList<Integer> comp : scc) {
			boolean good = true;
			for(Integer node : comp) {
				for(Integer next : adj[node]) {
					if(t.scc[next] != t.scc[node]) {
						good=false;
						break;
					}
				}
				if(good==false)break;
			}
			
			if(good) {
				if(comp.size() < best) {
					best = comp.size();
					res = comp;
				}
			}
		}
		
		out.println(best);
		for(Integer val : res) out.print((val+1)+" ");
		out.close();
		
		
	}
	
	static boolean vis[];
	static void bfs(int start) {
		ArrayDeque<Integer> q = new ArrayDeque<Integer>();
		q.add(start);
		int prev[] = new int[N];
		
	}
	
	static class center{
		int hour;
		ArrayList<Integer> clients;
		public center() {
			clients = new ArrayList<Integer>();
		}
	}

	
	static class tarjan{
	    int V;   //Vertices
	    int preCount;
	    int[] low;
	    boolean[] visited;      
	    ArrayList<Integer>[] graph;	//EdgeList
	    ArrayList<ArrayList<Integer>> sccComp;
	    Stack<Integer> stack;
	    int[] scc;
	    int curSCC;
	    //Get SCC components of an edge list
	    public ArrayList<ArrayList<Integer>> getSCComponents(ArrayList<Integer>[] graph) {
		scc = new int[graph.length];
		curSCC = 0;
		V = graph.length;
		this.graph = graph;
		low = new int[V];
		visited = new boolean[V];
		stack = new Stack<Integer>();
		sccComp = new ArrayList<>();

		for (int v = 0; v < V; v++)
		      if (!visited[v])
			dfs(v);

		return sccComp;
	    }

	    public void dfs(int v) {
		low[v] = preCount++;
		visited[v] = true;
		stack.push(v);
		int min = low[v];
		for (int w : graph[v]) {
		    if (!visited[w])
			dfs(w);
		    if (low[w] < min) 
			min = low[w];
		}
		if (min < low[v])  { 
		    low[v] = min; 
		    return; 
		}        
		ArrayList<Integer> component = new ArrayList<Integer>();
		int w;
		do{
		    w = stack.pop();
		    component.add(w);
		    low[w] = V;  
		    scc[w] = curSCC;
		} while (w != v);
		sccComp.add(component);
		curSCC++;
	    }    
	}
	
	
	
	
static class FastScanner{
	BufferedReader br;
	StringTokenizer st;
	public FastScanner(String s) {
		try{
			br = new BufferedReader(new FileReader(s));
		}
		catch(FileNotFoundException e) {
			e.printStackTrace();
		}
	}
	public FastScanner(){
		br = new BufferedReader(new InputStreamReader(System.in));
	}
	
	String nextToken()	{
		while(st == null ||!st.hasMoreElements()){
			try {
			st = new StringTokenizer(br.readLine());}
			catch(IOException e) {
				e.printStackTrace();
			}			
		}
		return st.nextToken();
	}
	
	int nextInt() {
		return Integer.parseInt(nextToken());
	}
	long nextLong() {
		return Long.parseLong(nextToken());
	}
	double nextDouble() {
		return Double.parseDouble(nextToken());
	}
	String next() {
		return nextToken();
	}
	
}

}
