from sys import setrecursionlimit
setrecursionlimit(1<<30)
def f(k,p,d):
    if k==0:
        return p^1
    if k<0:
        return p
    if (k,p) not in d:
        d[k,p]=p if any(f(k-i,p^1,d)==p for i in a) else p^1
    return d[k,p]
n,k=map(int,raw_input().split())
a=map(int,raw_input().split())
print 'First' if f(k,0,{})==0 else 'Second'
