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 sys

# sys.stind.readline lee datos el doble de
# rápido que la funcion por defecto input
input = sys.stdin.readline



def get_input():
    n, m, h = [int(x) for x in input().split(' ')]

    digraph = [[] for _ in range(n + 1)]
    transpose = [[] for _ in range(n + 1)]
    mantainence = [0] + [int(x) for x in input().split(' ')]

    for _ in range(m):
        c1, c2 = [int(x) for x in input().split(' ')]

        if (mantainence[c1] + 1) % h == mantainence[c2]:
            digraph[c1].append(c2)
            transpose[c2].append(c1)
        if (mantainence[c2] + 1) % h == mantainence[c1]:
            digraph[c2].append(c1)
            transpose[c1].append(c2)

    return digraph, transpose


def dfs_cc_1_visit(graph, node, color, finalization_stack):
    stack = [node]

    while stack:
        current_node = stack[-1]

        if color[current_node] != 'white':
            stack.pop()
            if color[current_node] == 'grey':
                finalization_stack.append(current_node)
                color[current_node] = 'black'
            continue

        color[current_node] = 'grey'
        for adj in graph[current_node]:
            if color[adj] == 'white':
                stack.append(adj)


def dfs_cc_1(graph):
    n = len(graph)
    finalization_stack = []
    color = ['white'] * n
    for i in range(1, n):
        if color[i] == 'white':
            dfs_cc_1_visit(graph, i, color, finalization_stack)    
    return finalization_stack


def dfs_cc_2_visit(graph, node, color, scc, component):
    stack = [node]

    while stack:
        current_node = stack[-1]

        if color[current_node] != 'white':
            stack.pop()
            color[current_node] = 'black'
            scc[current_node] = component
            continue

        color[current_node] = 'grey'
        for adj in graph[current_node]:
            if color[adj] == 'white':
                stack.append(adj)


def dfs_cc_2(graph, stack_time):
    n = len(graph)
    color = ['white'] * n
    scc = [0] * n
    component = 0
    while stack_time:
        current_node = stack_time.pop()
        if color[current_node] == 'white':
            dfs_cc_2_visit(graph, current_node, color, scc, component)
            component += 1

    return scc, component


def strongly_connected_components(digraph, transpose):
    stack_time = dfs_cc_1(digraph)
    scc, max_component = dfs_cc_2(transpose, stack_time)

    # create the components
    out_deg = [0] * max_component
    scc_nodes = [[] for _ in range(max_component)]
    for node in range(1, len(digraph)):
        scc_nodes[scc[node]].append(node)
        for adj in digraph[node]:
            if scc[node] != scc[adj]:
                out_deg[scc[node]] += 1
    
    # searching minimum strongly connectected component with out degree 0
    minimum_component = None
    for i, value in enumerate(out_deg):
        if value == 0 and (minimum_component is None or len(scc_nodes[i]) < len(scc_nodes[minimum_component])):
            minimum_component = i
    
    # return the size of the component and the nodes
    return len(scc_nodes[minimum_component]), scc_nodes[minimum_component]


if __name__ == "__main__":
    digraph, transpose = get_input()
    count, nodes = strongly_connected_components(digraph, transpose)
    
    print(count)
    print(' '.join([str(x) for x in nodes]))
