It is known that there are *k* fish species in the polar ocean, numbered from 1 to *k*. They are sorted by non-decreasing order of their weight, which is a positive number. Let the weight of the *i*-th type of fish be *w*<sub class="lower-index">*i*</sub>, then 0 &lt; *w*<sub class="lower-index">1</sub> ≤ *w*<sub class="lower-index">2</sub> ≤ ... ≤ *w*<sub class="lower-index">*k*</sub> holds.

Polar bears Alice and Bob each have caught some fish, and they are guessing who has the larger sum of weight of the fish he/she's caught. Given the type of the fish they've caught, determine whether it is possible that the fish caught by Alice has a strictly larger total weight than Bob's. In other words, does there exist a sequence of weights *w*<sub class="lower-index">*i*</sub> (not necessary integers), such that the fish caught by Alice has a strictly larger total weight?
The first line contains three integers *n*, *m*, *k* (1 ≤ *n*, *m* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>) — the number of fish caught by Alice and Bob respectively, and the number of fish species.

The second line contains *n* integers each from 1 to *k*, the list of fish type caught by Alice. The third line contains *m* integers each from 1 to *k*, the list of fish type caught by Bob.

Note that one may have caught more than one fish for a same species.
def in_list():
    return(list(map(int,input().split())))

def in_string_to_string():
    s = input()
    return s[:len(s)]

inputlist = in_list()
wind = in_string_to_string()

t, sx, sy, ex, ey = inputlist[0], inputlist[1], inputlist[2], inputlist[3], inputlist[4]

directions = {"N":(0, 1), "S":(0,-1), "E":(1,0),"W":(-1,0)}


curr = 0
can_complete = False
for d in wind:
    curr += 1
    x, y = directions[d]
    if sx > ex and x == -1:
        sx -= 1
    elif sx < ex and x == 1:
        sx += 1

    if sy > ey and y == -1:
        sy -= 1
    elif sy < ey and y == 1:
        sy += 1
    # print(sx == ex, sy == ey)
    if sx == ex and sy == ey:
        print(curr)
        can_complete = True
        break
    if curr > t:
        break
    

if not can_complete:
    print(-1)