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 

//package com.company;

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        MyScanner sc = new MyScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        long start = System.currentTimeMillis();
        Task t = new Task();
        t.solve(sc, pw);
        long end = System.currentTimeMillis();
//        pw.println("Used time " + (end - start) + "ms.");
        pw.close();
    }

    public static class Task {

        public void solve(MyScanner sc, PrintWriter pw) throws IOException {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int h = sc.nextInt();
            int[] centers = new int[n];
            for (int i = 0; i < n; i++) {
                centers[i] = sc.nextInt();
            }
            Set<Integer>[] used = new HashSet[n];
            for (int i = 0; i < n; i++) {
                used[i] = new HashSet<>();
            }
            SCC scc = new SCC(n, m);
            for (int i = 0; i < m; i++) {
                int a = sc.nextInt() - 1;
                int b = sc.nextInt() - 1;
                if (a > b) {
                    int t = a; a = b; b = t;
                }
                if ((centers[a] + 1) % h == centers[b] && !used[a].contains(b)) {
                    scc.add_edge(a + 1, b + 1);
                    used[a].add(b);
                } else if ((centers[b] + 1) % h == centers[a] && !used[b].contains(a)) {
                    scc.add_edge(b + 1, a + 1);
                    used[b].add(a);
                }
            }
            scc.run();
            int[] sizescc = new int[scc.group_cnt];
            Set<Integer>[] newRVEdge = new Set[scc.group_cnt];
            for (int i = 0; i < scc.group_cnt; i++) {
                newRVEdge[i] = new HashSet<>();
            }
            int[] deg = new int[scc.group_cnt];
            for (int i = 0; i < n; i++) {
                int sccI = scc.group_num[i + 1] - 1;
                sizescc[sccI] ++;
                for (int j : used[i]) {
                    int sccJ = scc.group_num[j + 1] - 1;
                    if (!newRVEdge[sccI].contains(sccJ)){
                        newRVEdge[sccI].add(sccJ);
                        deg[sccI]++;
                    }
                }
            }
//            boolean[] visited = new boolean[scc.group_cnt];

            int minEndVal = Integer.MAX_VALUE;
            int minEndIdx = 0;
            for (int i = 0; i < scc.group_cnt; i++) {
                if (deg[i] == 0) {
                    if (sizescc[i] < minEndVal) {
                        minEndVal = sizescc[i];
                        minEndIdx = i;
                    }
                }
            }

            int cnt = 0;
            List<Integer> tp = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                if (scc.group_num[i + 1] - 1 == minEndIdx) {
                    tp.add(i + 1);
                    cnt++;
                }
            }
            pw.println(cnt);
            for (int i = 0; i < cnt; i++) {
                pw.print(tp.get(i) + " ");
            }

//            for (int i = 0; i < scc.group_cnt; i++) {
//                if (deg[i] == 0 && !visited[i]) {
//                    if (sizescc[i] < minEndVal) {
//                        minEndVal = sizescc[i];
//                        minEndIdx = i;
//                    }
//                    Stack<Integer> st = new Stack<>();
//                    st.push(i);
//                    visited[i] = true;
//                    while (!st.empty()) {
//                        int t = st.pop();
//                        for(int j : newRVEdge[t]) {
//                            if (!visited[j]) {
//                                visited[j] = true;
//                                st.push(j);
//                            }
//                        }
//                    }
//                }
//            }
//            int minim = Integer.MAX_VALUE;
//            Set<Integer> minidx = new HashSet<>();
//            List<Integer> tmpIdx = new ArrayList<>();
//            for (int i = 0; i < scc.group_cnt; i++) {
//                int cnt = 0;
//                if (!visited[i]) {
//                    tmpIdx.clear();
//                    Stack<Integer> st = new Stack<>();
//                    st.push(i);
//                    visited[i] = true;
//                    while (!st.empty()) {
//                        int t = st.pop();
//                        tmpIdx.add(t);
//                        cnt+=sizescc[t];
//                        for(int j : newRVEdge[t]) {
//                            if (!visited[j]) {
//                                visited[j] = true;
//                                st.push(j);
//                            }
//                        }
//                    }
//                    if (cnt < minim) {
//                        minidx.clear();
//                        minidx.addAll(tmpIdx);
//                        minim = cnt;
//                    }
//                }
//            }
//            if (minEndVal < minim) {

//            } else {
//                int cnt = 0;
//                List<Integer> tp = new ArrayList<>();
//                for (int i = 0; i < n; i++) {
//                    if (minidx.contains(scc.group_num[i + 1] - 1)) {
//                        tp.add(i + 1);
//                        cnt++;
//                    }
//                }
//                pw.println(cnt);
//                for (int i = 0; i < cnt; i++) {
//                    pw.print(tp.get(i) + " ");
//                }
//            }
//            pw.println();

        }

    }

    public static class SCC {
        public class Edge{
            int e, nxt;
            Edge(){}
        }
        public int V = 0, E = 0;
        public Edge[] e, er;
        public int[] sp, spr, group_num, stk;
        public int group_cnt;
        public boolean[] v;
        public void fill_forward(int x){
            v[x] = true;
            for (int i = sp[x]; i != 0; i = e[i].nxt) {
                if (!v[e[i].e]) fill_forward(e[i].e);
            }
            stk[++stk[0]] = x;
        }
        public void fill_backward(int x){
            v[x] = false;
            group_num[x] = group_cnt;
            for (int i = spr[x]; i != 0; i = er[i].nxt) {
                if (v[er[i].e]) fill_backward(er[i].e);
            }
        }
        public void add_edge(int v1, int v2){
            e[++E].e = v2; e[E].nxt = sp[v1]; sp[v1] = E;
            er[E].e = v1; er[E].nxt = spr[v2]; spr[v2] = E;
        }
        public SCC(int n, int m){
            e = new Edge[m + 10];
            er = new Edge[m + 10];
            V = n;
            for (int i = 0; i < m + 10; i++) {
                e[i] = new Edge();
                er[i] = new Edge();
            }
            sp = new int[n + 10];
            spr = new int[n + 10];
            group_num = new int[n + 10];
            stk = new int[n + 10];
            v = new boolean[n + 10];
        }
        public void run(){
            stk[0] = 0;
            Arrays.fill(v, false);
            for (int i = 1; i <= V; i++) {
                if (!v[i]) fill_forward(i);
            }
            group_cnt = 0;
            for (int i = stk[0]; i >= 1; i--) {
                if(v[stk[i]]) {
                    group_cnt++;
                    fill_backward(stk[i]);
                }
            }
        }
    }

    static class MyScanner {
        StringTokenizer st;
        BufferedReader br;

        public MyScanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}

        public MyScanner(FileReader s) throws FileNotFoundException {br = new BufferedReader(s);}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {return Integer.parseInt(next());}

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException { return Double.parseDouble(next()); }

        public boolean ready() throws IOException {return br.ready();}
    }
}
