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.*;

public class MainClass
{
    static int n = 0;
    static int m = 0;
    static Set<Integer>[] adj;
    static boolean[] visited;
    static int h = 0;
    static int[] H;
    static Game[] postOrder;
    static int clock = 0;
    static int UNVISITED = -1;
    static int id = 0;
    static int[] ids;
    static int[] low;
    static boolean[] onStack;
    static Stack<Integer> stack;
    static int sccCount = 0;
    static Set<Integer>[] modAdj;
    static int[] count;
    public static void main(String[] args)throws IOException
    {
        Reader in = new Reader();
        n = in.nextInt();
        m = in.nextInt();
        h = in.nextInt();
        adj = new HashSet[n];
        visited = new boolean[n];
        H = new int[n];
        ids = new int[n];
        low = new int[n];
        onStack = new boolean[n];
        stack = new Stack<>();

        for (int i=0;i<n;i++) adj[i] = new HashSet<>();
        for (int i=0;i<n;i++) H[i] = in.nextInt();
        int[] from = new int[m];
        int[] to = new int[m];
        for (int i=0;i<m;i++)
        {
            int x = in.nextInt() - 1;
            int y = in.nextInt() - 1;
            from[i] = x;    to[i] = y;
            if ((H[x] + 1) % h == H[y]) adj[x].add(y);
            if ((H[y] + 1) % h == H[x]) adj[y].add(x);
        }

        findSccs();
        modAdj = new HashSet[sccCount];
        postOrder = new Game[sccCount];
        count = new int[sccCount];
        for (int i=0;i<sccCount;i++)    modAdj[i] = new HashSet<>();
        for (int i=0;i<m;i++)
        {
            int x = from[i];
            int y = to[i];
            if (low[x] == low[y])continue;
            if ((H[x] + 1) % h == H[y]) modAdj[low[x]].add(low[y]);
            if ((H[y] + 1) % h == H[x])    modAdj[low[y]].add(low[x]);
        }
        for (int i=0;i<n;i++)   count[low[i]]++;
        visited = new boolean[sccCount];
        for (int i=0;i<sccCount;i++)    if (!visited[i])    explore(i);
        Arrays.sort(postOrder);
        long[] dp = new long[sccCount];
        for (int i=sccCount - 1;i>=0;i--)
        {
            int v = postOrder[i].v;
            dp[v] += postOrder[i].size;
            for (int u: modAdj[v])  dp[v] += dp[u];
        }
        long min = Long.MAX_VALUE;
        int idx = -1;
        for (int i=0;i<sccCount;i++)
        {
            if (dp[i] < min)
            {
                min = dp[i];
                idx = i;
            }
        }
        System.out.println(min);
        StringBuilder stringBuilder = new StringBuilder();
        for (int i=0;i<n;i++)
        {
            if (low[i] == idx)
            {
                stringBuilder.append(i + 1).append(" ");
            }
        }
        System.out.println(stringBuilder);
    }
    public static void explore(int v)
    {
        visited[v] = true;
        for (int u: modAdj[v]) if (!visited[u]) explore(u);
        postOrder[v] = new Game(v, clock++, count[v]);
    }
    public static void findSccs()
    {
        for (int i=0;i<n;i++)
            ids[i] = UNVISITED;
        for (int i=0;i<n;i++)
        {
            if (ids[i] == UNVISITED)
            {
                dfs(i);
            }
        }
    }
    public static void dfs(int at)
    {
        stack.push(at);
        onStack[at] = true;
        ids[at] = low[at] = id++;

        //Visit all neighbours and min low-link values on callback
        for (int to: adj[at])
        {
            if (ids[to] == UNVISITED)
                dfs(to);
            if (onStack[to])
                low[at] = Math.min(low[at], low[to]);
        }

        //After having visited all the neighbours of 'at'
        //if we're at the start of a SCC empty the seen
        //stack until we're back to the start of the SCC.

        if (ids[at] == low[at])
        {
            for (int node = stack.pop();;node = stack.pop())
            {
                onStack[node] = false;
                low[node] = sccCount;
                if (node == at)
                    break;
            }
            sccCount++;
        }
    }
}
class Game implements Comparable<Game>
{
    int v;
    int time;
    int size;

    public Game(int v, int time, int size)
    {
        this.v = v;
        this.time = time;
        this.size = size;
    }

    @Override
    public int compareTo(Game ob)
    {
        return ob.time - this.time;
    }
}
class Reader
{
    final private int BUFFER_SIZE = 1 << 16;
    private final DataInputStream din;
    private final byte[] buffer;
    private int bufferPointer, bytesRead;

    public Reader()
    {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public Reader(String file_name) throws IOException
    {
        din = new DataInputStream(new FileInputStream(file_name));
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public String readLine() throws IOException
    {
        byte[] buf = new byte[64]; // line length
        int cnt = 0, c;
        while ((c = read()) != -1)
        {
            if (c == '\n')
                break;
            buf[cnt++] = (byte) c;
        }
        return new String(buf, 0, cnt);
    }

    public int nextInt() throws IOException
    {
        int ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do
        {
            ret = ret * 10 + c - '0';
        }  while ((c = read()) >= '0' && c <= '9');

        if (neg)
            return -ret;
        return ret;
    }

    public long nextLong() throws IOException
    {
        long ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');
        if (neg)
            return -ret;
        return ret;
    }

    public double nextDouble() throws IOException
    {
        double ret = 0, div = 1;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();

        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');

        if (c == '.')
        {
            while ((c = read()) >= '0' && c <= '9')
            {
                ret += (c - '0') / (div *= 10);
            }
        }

        if (neg)
            return -ret;
        return ret;
    }

    private void fillBuffer() throws IOException
    {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1)
            buffer[0] = -1;
    }

    private byte read() throws IOException
    {
        if (bufferPointer == bytesRead)
            fillBuffer();
        return buffer[bufferPointer++];
    }

    public void close() throws IOException
    {
        if (din == null)
            return;
        din.close();
    }
}