# coding: utf-8



import sys

input = sys.stdin.readline



def f(N, A, K):

    dp = [0] * (K + 1)

    for i in range(K + 1):

        for x in A:

            if i < x:

                break

            if not dp[i - x]:

                dp[i] = 1

                break

    return(dp[K])



ans = [ "Second", "First" ]

n, k = list(map(int, input().split())) # 1 <= n <= 100, 1 <= k <= 10^5

a = list(map(int, input().split()))

print((ans[f(n, a, k)]))

# coding: utf-8



import sys

input = sys.stdin.readline



def f2(N, A, K):

    dp = [0] * (K + 1)

    for i in range(K + 1):

        if dp[i] == 0:

            # 残りi個で負けなので、ai個足した状況は勝ちになる。

            for x in A:

                if i + x <= K:

                    dp[i + x] = 1

    return(dp[K])



ans = [ "Second", "First" ]

n, k = list(map(int, input().split())) # 1 <= n <= 100, 1 <= k <= 10^5

a = list(map(int, input().split()))

print((ans[f2(n, a, k)]))

# coding: utf-8
import sys

input = sys.stdin.readline


def f(N, A, K):
    dp = [0] * (K + 1)
    for i in range(K + 1):
        for x in A:
            if i < x:
                break
            if not dp[i - x]:
                dp[i] = 1
                break
    return dp[K]


ans = ["Second", "First"]
n, k = list(map(int, input().split()))  # 1 <= n <= 100, 1 <= k <= 10^5
a = list(map(int, input().split()))
print((ans[f(n, a, k)]))

# coding: utf-8
import sys

input = sys.stdin.readline


def f2(N, A, K):
    dp = [0] * (K + 1)
    for i in range(K + 1):
        if dp[i] == 0:
            # 残りi個で負けなので、ai個足した状況は勝ちになる。
            for x in A:
                if i + x <= K:
                    dp[i + x] = 1
    return dp[K]


ans = ["Second", "First"]
n, k = list(map(int, input().split()))  # 1 <= n <= 100, 1 <= k <= 10^5
a = list(map(int, input().split()))
print((ans[f2(n, a, k)]))

-def f(N, A, K): +def f2(N, A, K): -        for x in A: -            if i < x: -                break -            if not dp[i - x]: -                dp[i] = 1 -                break +        if dp[i] == 0: +            # 残りi個で負けなので、ai個足した状況は勝ちになる。 +            for x in A: +                if i + x <= K: +                    dp[i + x] = 1 -print((ans[f(n, a, k)])) +print((ans[f2(n, a, k)]))