#include<bits/stdc++.h>
using namespace std;
long long n, k, dp[200000], a[200000];
int main()
{
	cin >> n >> k;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	for (int i = 1; i <= k; i ++)
	{
		for (int j = 1; j <= n; j ++)
		{
			if (i - a[j] >= 0 && dp[i-a[j]] == 0) {
				dp[i] = 1;
				break;
			}
		}
	}
	if (dp[k] == 1)
		cout << "First";
			else
		cout << "Second";	
}