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.*;
import java.io.*;
public class Graph
{
	int n;
	int m;
	int h;
	int[] u;
	int s;
	int[] dest;
	int[] next;
	int[] head;
	int[] visit;
	int[] result;
	Graph() 
	{
		//try{
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		h = sc.nextInt();
		u = new int[n];
		s = 0;
		dest = new int[2*m];
		next = new int[2*m];
		head = new int[n];
		
		
		for(int i = 0; i < n; i++)
		{
			u[i] = sc.nextInt();
			
		}
		
		for(int i = 0; i < n; i++)
		{
			head[i] = -1;
		} 
		
		for(int i = 0; i < m; i++)
		{
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			add(a, b);
			add(b, a);
			
			
		}
		
		visit = new int[n];
		for(int i = 0; i < n; i++)
		{
			visit[i] = 0;
		}
		
		result = new int[n];
		for(int i = 0; i < n; i++)
		{
			result[i] = -1;
		}
		/*}
		catch(FileNotFoundException e)
		{
			return;
		}*/
	}
	
	public void add(int u, int v)
	{
		dest[s] = v;
		next[s] = head[u];
		head[u] = s;
		s = s + 1;
		
		
	}
	
	public void dfs(int i, int parent)
	{
		//System.out.println("In " + i);
		visit[i] = 1;
		if(i != parent)
		{
			if(u[i] != u[parent])
			{
				result[i] = 1;
				if(result[parent] == -1)
				{
					result[parent] = 1;
				}
			}
			else if(u[i] == u[parent])
			{
				result[i] = 1;
				result[parent] = 0;
			}
		}
		int j = head[i];
		while(j != -1)
		{
			parent = i;
			if(visit[dest[j]] == 0)
			{
				dfs(dest[j], parent);
			}
				if(u[i] != u[dest[j]])
				{
					result[i] = 1;
					if(result[dest[j]] == -1)
					{
						result[dest[j]] = 1;
					}
				}
				else if(u[i] == u[parent])
				{
					result[i] = 1;
					result[dest[j]] = 0;
				}
			j = next[j];
		}
		//System.out.println("Out " + i);
	}
	
	public static void main(String[] args)
	{
		Graph gr = new Graph();
		gr.dfs(0, 0);
		int quantity = 0;
		for(int i = 0; i < gr.n; i ++)
		{
			if(gr.result[i] == 1)
			{
				quantity++;
			}
		}
		System.out.println(quantity);
		for(int i = 0; i < gr.n; i ++)
		{
			if(gr.result[i] == 1)
			{
				System.out.print((i + 1) + " ");
			}
		}
	}
	
}
