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.
class Node:
    def __init__(self, color):
        self.neighbours = set()
        self.neighbours_colors = set()
        self.color = color

    def addNode(self, node):
        self.neighbours.add(node)
        self.neighbours_colors.add(node.color)
        

nodes = []
n, m = map(lambda k: int(k), input().split())

for index, c in enumerate(input().split()):
    #print(index + 1, c)
    #nodes[index + 1] = Node(c)
    nodes.append(Node(c))

for i in range(m):
    a, b = map( lambda k: int(k), input().split())
    nodes[a - 1].addNode(nodes[b - 1])
    nodes[b - 1].addNode(nodes[a - 1])

m = (0, -1)
for node in nodes:
    collen = len(node.neighbours_colors)
    klen = collen - 1 if node.color in node.neighbours_colors else collen
    #print (collen, klen)
    if (klen > m[0]):
        m = (klen, node.color)
    elif klen == m[0] and node.color < m[1]:
        m = (klen, node.color)


print(m[1])
