// Slower C++ solution:
#define _CRT_SECURE_NO_WARNINGS

#include<bits/stdc++.h>

#include<iostream>

#include<algorithm>

#include<iomanip>

#include<string>

#include<cmath>

#include<vector>

#include<set>

#include<queue>

#include<stack>

#include<fstream>

#include<map>

#include<bitset>

#include<unordered_map>

#include<cstring>

#include<cctype>

using namespace std;

#define  ll long long

#define  ull unsigned long long

#define  ul unsigned long

#define all(v) v.begin(),v.end()

#define sz(n) (int)n.size()

#define pb(s) push_back(s);

#define format(n) fixed<<setprecision(n)

#define finl "\n"

#define Mohammed_Atef_Hassan fast();

#define mod 1000000007

#define INF LLONG_MAX

#define PI acos(-1)

#define clr(dp,n) memset(dp,n,sizeof dp)

#define ex(n) return cout<<n<<finl,0;

int dx[] = { 0, 1, 0, -1, 1, 1, -1, -1 };

int dy[] = { 1, 0, -1, 0, 1, -1, 1, -1 };

ll fix_mod(ll x, ll y)

{

	return (y + x % y) % y;

}

void fast() {

	std::ios_base::sync_with_stdio(false);

	cin.tie(nullptr); cout.tie(nullptr);



#ifdef ONLINE_JUDGE

	//freopen("crosses.in", "r", stdin);



	//freopen("crosses.out", "w", stdout);

#endif

#ifndef ONLINE_JUDGE

	//freopen("input.in", "r", stdin);

	//freopen("output.out", "w", stdout);

#endif

}

vector<int>v;

int mem[(int)1e5 + 10][3];

int solve(int k, int c)

{

	int& ret = mem[k][c];

	if (~ret)return ret;

	for (int i = 0; i < v.size(); i++)

	{

		if (k >= v[i])

		{

			if (solve(k - v[i], c % 2 + 1) == c)return ret=c;

		}

	}

	return ret= c % 2 + 1;

}

int main()

{

	Mohammed_Atef_Hassan

		clr(mem, -1);

		int n, k;

	cin >> n >> k;

	v = vector<int>(n);

	for (int i = 0; i < n; i++)cin >> v[i];

	cout << (solve(k, 1) == 1 ? "First" : "Second") << finl;

}

// Faster C++ solution for the same problem (measured speedup: 2.0107658951649117x):
#pragma region

#include <algorithm>

#include <cstring>

#include <iomanip>

#include <iostream>

#include <map>

#include <queue>

#include <stack>

#include <string>

#include <vector>

typedef long long ll;

#define rep(i, a, n) for (long long i = a; i <= n; ++i)

#define per(i, a, n) for (long long i = n; i >= a; --i)

#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

using namespace std;

/*

 *                                                     __----~~~~~~~~~~~------___

 *                                    .  .   ~~//====......          __--~ ~~

 *                    -.            \_|//     |||\\  ~~~~~~::::... /~

 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-

 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~

 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /

 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /

 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /

 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\

 *           '         ~-|      /|    |-~\~~       __--~~

 *                       |-~~-_/ |    |   ~\_   _-~            /\

 *                            /  \     \__   \/~                \__

 *                        _--~ _/ | .-~~____--~-/                  ~~==.

 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||

 *                                  -_     ~\      ~~---l__i__i__i--~~_/

 *                                  _-~-__   ~)  \--______________--~~

 *                                //.-~~~-~_--~- |-------~~~~~~~~

 *                                       //.-~~~--\

 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

 */

#pragma endregion

const int maxn = 105;

bool dp[int(1e7 + 5)][2];

int n, k, a[maxn];

bool dfs(int x, bool f) {

    if (dp[x][f]) return dp[x][f];

    bool flag = 0;

    rep(i, 1, n) if (x >= a[i]) {

        if (!dfs(x - a[i], 1 - f))

            flag = 1;

    }

    return dp[x][f] = flag;

}

int main() {

    IO;

    cin >> n >> k;

    rep(i, 1, n) cin >> a[i];

    cout << (dfs(k, 0) ? "First\n" : "Second\n");

}