#include<bits/stdc++.h>
using namespace std;

int n, k, a[101], dp[N];

int main()
{
	memset(dp, -1, sizeof(dp));

	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", a + i);
	}
	

	for (int i = 0; i <= k; i++)
	{
		dp[i] = 0;
		for (int j = 0; j < n; j++)
		{
			if (i - a[j] == 0)
			{
				dp[i] |= 1;
			}
			else if (i - a[j] > 0)
			{
				dp[i] |= dp[i - a[j]] ^ 1;
			}
			else
			{
				dp[i] |= 0;
			}
		}
	}

	puts((dp[k] ? "First" : "Second"));
}