#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define AB_BHI_NI_DEGI                \
	ios_base::sync_with_stdio(false); \
	cin.tie(NULL);                    \
	cout.tie(NULL);
#define int long long
#define pb push_back
#define N 100009
#define inf 1e18
const double PI = 3.141592653589793238462643383279;
int mod = 1e9 + 7;
//int mod = 998244353;
#define P pair<int, int>
#define F first
#define S second
#define ll long long
#define all(v) v.begin(), v.end()
#define vi vector<int>
#define ld long double

#define ordered_set tree<P, null_type, less<P>, rb_tree_tag, tree_order_statistics_node_update>

void end(int n = -1)
{
	cout << n << "\n";
	exit(0);
}
int n, k;
int a[103];
int dp[N];

int fun(int rem)
{
	if (dp[N])
		return dp[N];
	for (int i = 1; i <= n; i++)
	{
		if (rem >= a[i])
		{
			if (fun(rem - a[i]) == 2)
			{
				dp[rem] = 1;
				return dp[rem];
			}
		}
	}
	return dp[rem] = 2;
}

int32_t main()
{
	AB_BHI_NI_DEGI
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	int x = fun(k);
	if (x == 1)
		cout << "First\n";
	else
		cout << "Second\n";

	return 0;
}