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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class DataCenterMaintenanceC469 {
	static LinkedList<Integer>[] edges;
	static int[] vals,sizes, indAnc;
	static int gc;
	public static void main(String[] args) throws NumberFormatException, IOException {	
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		StringTokenizer st=new StringTokenizer(in.readLine());
		int n=Integer.parseInt(st.nextToken()),m=Integer.parseInt(st.nextToken()),h=Integer.parseInt(st.nextToken());
		edges=new LinkedList[n];
		for(int i=0;i<n;i++)
			edges[i]=new LinkedList<Integer>();
		st=new StringTokenizer(in.readLine());
		vals=new int[n];
		for(int i=0;i<n;i++)
			vals[i]=Integer.parseInt(st.nextToken());
		int a,b;
		for(int i=0;i<m;i++) {
			st=new StringTokenizer(in.readLine());
			a=Integer.parseInt(st.nextToken())-1;
			b=Integer.parseInt(st.nextToken())-1;
			if(vals[a]==(vals[b]+1)%h)
				edges[b].add(a);
			if(vals[b]==(vals[a]+1)%h)
				edges[a].add(b);
		}
		initSCC(n);
		int bestInd=-1,bestSize=Integer.MAX_VALUE,t;
		boolean[] check=new boolean[n];
		for(int i=1;i<n;i++) {
			if(!check[i]){
				t=i;
				while(indAnc[t]!=t) {
					check[t]=true;
					t=indAnc[t];
				}
				check[t]=true;
				if(sizes[t]<bestSize) {
					bestSize=sizes[t];
					bestInd=t;
				}
			}
		}
		out.println(sizes[bestInd]);
		printNodes(bestInd,new boolean[n],out );
		out.println();
		in.close();
		out.close();
	}
	public static void initSCC(int n) {
		gc=0;
		sizes=new int[n];
		int[] ind=new int[n];
		int[] anc=new int[n];
		indAnc=new int[n];
		int[] reverse=new int[n];
		boolean[] inc=new boolean[n];
		for(int i=0;i<n;i++)
			ind[i]=-1;
		for(int i=0;i<n;i++) 
			if(ind[i]==-1) 
				traverse(i,new LinkedList<Integer>(),ind,anc,reverse,inc);
	}
	public static void traverse(int pos, LinkedList<Integer> st, int[] ind, int[] anc, int[] reverse, boolean[] inc) {
		inc[pos]=true;
		ind[pos]=anc[pos]=gc;
		reverse[gc]=pos;
		sizes[pos]=1;
		st.add(pos);
		gc++;
		for(Integer c:edges[pos]) {
			if(ind[c]==-1) {
				traverse(c,st,ind,anc,reverse,inc);
				anc[pos]=Math.min(anc[pos],anc[c]);
				sizes[pos]+=sizes[c];
			}
			else if(inc[c])
				anc[pos]=Math.min(anc[pos],ind[c]);
			else
				sizes[pos]+=sizes[indAnc[c]];
		}
		if(ind[pos]==anc[pos]) {
			while(!st.isEmpty()&&st.getLast()!=pos)
				inc[st.pollLast()]=false;
			inc[st.pollLast()]=false;
		}
		indAnc[pos]=reverse[anc[pos]];
	}
	public static void printNodes(int ind, boolean[] check,PrintWriter out) {
		out.print((ind+1)+" ");
		check[ind]=true;
		for(Integer c:edges[ind])
			if(!check[c])
				printNodes(c,check,out);
	}
}
