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.*;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class B1 {
    static BufferedReader in;
    static StringTokenizer st;
    static PrintWriter out;

    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        nextLine();
        int n = nextInt();
        long m = nextInt();
        long h = nextInt();
        nextLine();
        Graph g = new Graph(n);
        long time[] = new long[n];
        for (int i = 0; i < n; i++) {
            time[i] = nextInt();
        }
        for (int i = 0; i < m; i++) {
            nextLine();
            long x = nextInt() - 1;
            long y = nextInt() - 1;
            if ((time[(int)x] + 1) % h == time[(int)y]) {
                g.edge((int)x, (int)y);
            }
            if ((time[(int)y] + 1) % h == time[(int)x]) {
                g.edge((int)y, (int)x);
            }
        }
        Graph rev = reverse(g);
        long cur = 0;
        dfs = new long[n];
        marked = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (!marked[i]) {
                cur = dfs(rev, i, (int)cur);
            }
        }
        for (int i = 0; i < n / 2; i++) {
            long swap = dfs[i];
            dfs[i] = dfs[n - 1 - i];
            dfs[n - 1 - i] = swap;
        }
        marked1 = new long[n];
        long count = 1;
        for (int i = 0; i < n; i++) {
            if (marked1[(int)dfs[i]] == 0) {
                dfs1((int)count, g,(int) dfs[i]);
                count++;
            }
        }
        Graph derevo = new Graph((int)count);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < g.adj[i].size(); j++) {
                if (marked1[i] - 1 != marked1[(int) g.adj[i].get(j)] - 1) {
                    derevo.edge((int)marked1[i] - 1, (int)marked1[(int) g.adj[i].get(j)] - 1);
                }
            }
        }
        count--;
        mas = new long[(int)count];
        for (long i = 0; i < n; i++) {
            mas[(int)marked1[(int)i] - 1]++;
        }
        dp = new long[(int)count];
        for (long i = 0; i < count; i++) {
            if (dp[(int)i] == 0) {
                dfs2((int)i, derevo);
            }
        }
        long min = 1000_000_000;
        long koor = 0;
        for (long i = 0; i < count; i++) {
            if (dp[(int)i] < min) {
                koor = i + 1;
                min = dp[(int)i];
            }
        }
        if (min == 0) {
            long wr[] = new long[2];
            wr[3] = 0;
        }
        out.println(min);
        for (int i = 0; i < n; i++) {
            if (marked1[i] == koor) {
                dfs5(i, g);
                i = n;
            }
        }
        out.close();
    }

    private static void dfs5(int tek, Graph g) {
        marked = new boolean[g.lenght];
        Stack s = new Stack();
        s.paste(tek);
        while (!s.empty()) {
            tek = s.take();
            out.print((tek + 1) + " ");
            marked[tek] = true;
            for (int j = 0; j < g.adj[tek].size(); j++) {
                if (!marked[(int) g.adj[tek].get(j)]) {
                    s.paste((int) g.adj[tek].get(j));
                    marked[(int) g.adj[tek].get(j)] = true;
                }
            }
        }
    }

    static boolean marked[];
    static long marked1[];
    static long dp[];
    static long mas[];
    static long[] dfs;

    public static void dfs2(int tek, Graph g) {
        dp[tek] = mas[tek];
        for (int i = 0; i < g.adj[tek].size(); i++) {
            if (dp[(int) g.adj[tek].get(i)] == 0) {
                dfs2((int) g.adj[tek].get(i), g);
                dp[tek] += dp[(int) g.adj[tek].get(i)];
            }
        }
    }

    public static void dfs1(int count, Graph g, int tek) {
        Stack s = new Stack();
        s.paste(tek);
        while (!s.empty()) {
            tek = s.take();
            marked1[tek] = count;
            for (int j = 0; j < g.adj[tek].size(); j++) {
                if (marked1[(int) g.adj[tek].get(j)] == 0) {
                    s.paste((int) g.adj[tek].get(j));
                    marked1[(int) g.adj[tek].get(j)] = count;
                }
            }
        }
    }

    public static long dfs(Graph g, int tek, long cur) {
        marked[tek] = true;
        for (int i = 0; i < g.adj[tek].size(); i++) {
            if (!marked[(int) g.adj[tek].get(i)]) {
                cur = dfs(g, (int) g.adj[tek].get(i), cur);
            }
        }
        dfs[(int)cur] = tek;
        return cur + 1;
    }

    public static class Stack {
        int tek;
        int mas[];

        public Stack() {
            tek = 0;
            mas = new int[2];
        }

        public void paste(int x) {
            if (tek == mas.length) {
                int th[] = new int[tek * 2];
                for (int i = 0; i < tek; i++) {
                    th[i] = mas[i];
                }
                mas = th;
            }
            mas[tek++] = x;
        }

        public int take() {
            return mas[--tek];
        }

        public boolean empty() {
            if (tek == 0) {
                return true;
            }
            return false;
        }
    }

    public static Graph reverse(Graph g) {
        Graph ans = new Graph(g.lenght);
        for (int i = 0; i < g.lenght; i++) {
            for (int j = 0; j < g.adj[i].size(); j++) {
                ans.edge((int) g.adj[i].get(j), i);
            }
        }
        return ans;
    }

    public static void nextLine() throws IOException {
        st = new StringTokenizer(in.readLine());
    }

    public static int nextInt() {
        return Integer.parseInt(st.nextToken());
    }

    public static class Graph {
        int lenght;
        ArrayList adj[];

        public Graph(int n) {
            lenght = n;
            adj = new ArrayList[lenght];
            for (int i = 0; i < lenght; i++) {
                adj[i] = new ArrayList();
            }
        }

        public void edge(int x, int y) {
            adj[(int)x].add(y);
        }
    }
}