#include<bits/stdc++.h>

using namespace std;
#define int long long

int n,a[10005],k,f[100005][2];
int F(int i,int ok)
{
	if(f[i][ok]!=-1) return f[i][ok];
	else if(i<a[1])
	{
		return 1-ok;
	}
	else
	{
		int res;
		if(ok==1)
		{
			res=0;
			for(int j=1;j<=n;j++)
			{
				res=max(res,F(i-a[j],0));
			}
			f[i][ok]=res;
		}
		else
		{
			res=1;
			for(int j=1;j<=n;j++)
			{
				res=min(res,F(i-a[j],1));
			}
			f[i][ok]=res;
		}
		return res;
	}
}
main()
{
	cin>>n>>k;
	memset(f,-1,sizeof(f));
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1);
	if(F(k,1))cout<<"Second";
	else cout<<"First";

}