You've got an undirected graph, consisting of *n* vertices and *m* edges. We will consider the graph's vertices numbered with integers from 1 to *n*. Each vertex of the graph has a color. The color of the *i*-th vertex is an integer *c*<sub class="lower-index">*i*</sub>.

Let's consider all vertices of the graph, that are painted some color *k*. Let's denote a set of such as *V*(*k*). Let's denote the value of the neighbouring color diversity for color *k* as the cardinality of the set *Q*(*k*) = {*c*<sub class="lower-index">*u*</sub> :  *c*<sub class="lower-index">*u*</sub> ≠ *k* and there is vertex *v* belonging to set *V*(*k*) such that nodes *v* and *u* are connected by an edge of the graph}.

Your task is to find such color *k*, which makes the cardinality of set *Q*(*k*) maximum. In other words, you want to find the color that has the most diverse neighbours. Please note, that you want to find such color *k*, that the graph has at least one vertex with such color.
The first line contains two space-separated integers *n*, *m* (1 ≤ *n*, *m* ≤ 10<sup class="upper-index">5</sup>) — the number of vertices end edges of the graph, correspondingly. The second line contains a sequence of integers *c*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">2</sub>, ..., *c*<sub class="lower-index">*n*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>) — the colors of the graph vertices. The numbers on the line are separated by spaces.

Next *m* lines contain the description of the edges: the *i*-th line contains two space-separated integers *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> ≤ *n*; *a*<sub class="lower-index">*i*</sub> ≠ *b*<sub class="lower-index">*i*</sub>) — the numbers of the vertices, connected by the *i*-th edge. 

It is guaranteed that the given graph has no self-loops or multiple edges.
#parsea una línea
def parser():
    return [int(x) for x in input().split()]
    
#Recibiendo n y m
n,m=parser()
#Recibiendo los colores de los vértices
colors_vertices=parser()

#Hallando el mayor de colores
upper=max(colors_vertices)

#Creando la matriz de adyacencia
color_graph=[[False for x in range(upper)] for y in range(upper)]

#Analizando las aristas
for i in range(m):
    #Leer una arista
    edge=parser()
    #Obteniendo los colores de los vértices
    color1=colors_vertices[edge[0]-1]
    color2=colors_vertices[edge[1]-1]
    #Si son distintos los colores actualizamos la matriz de adyacencia
    if color1 != color2:
        color_graph[color1-1][color2-1]=True
        color_graph[color2-1][color1-1]=True

#Cantidad máxima de vecinos
max_neighbours=0
#color que tiene dicha cantidad de vecinos
color=0

#Encontrando dicho cantidad y dicho color
for i in range(upper):
    color_neighbours=0
    for j in range(upper):
        if color_graph[i][j]:
            color_neighbours+=1
    if color_neighbours>max_neighbours:
        max_neighbours=color_neighbours
        color=i+1

#Si ningún color tiene vecinos buscar el menor e imprimirlo, en caso contrario imprimir el color cuya cantidad de vecinos es máxima
if max_neighbours==0:
    print(min(colors_vertices))
else:
    print(color)