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.
import sys
d = {}
colors = []


def inpt():
    inp = sys.stdin.readline()
    n, m = map(int, inp.split())
    inp = sys.stdin.readline()
    colors = list(map(int, inp.split()))
    for i in range(m):
        a, b = map(int, input().split())
        a -= 1
        b -= 1
        if colors[a] not in d.keys():
            d[colors[a]] = set()
            d[colors[a]].add(colors[b])
        else:
            d[colors[a]].add(colors[b])
        if colors[b] not in d.keys():
            d[colors[b]] = set()
            d[colors[b]].add(colors[a])
        else:
            d[colors[b]].add(colors[a])


def add():
    for c in colors:
        if c not in d.keys():
            d[c] = set()
            d[c].add(c)
        else:
            d[c].add(c)


def answer():
    mx = -1
    ans = 0
    for c in d.keys():
        if len(d[c]) > mx:
            mx = len(d[c])
            ans = c
    for c in d.keys():
        if len(d[c]) == mx:
            if c < ans:
                ans = c
    sys.stdout.write(str(ans))


inpt()
add()
answer()