
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	private static Scanner in;
	
	private static int n;
	private static int k;
	private static int[] a;
	private static long[][] dp;
	private static final int MOD = (int)1e9+7;
	
	public static void main(String[] args) {
		in = new Scanner(System.in);
		n = in.nextInt();
		k = in.nextInt();
		a =  new int[n];
		for(int i=0; i<n; i++) {
			a[i] = in.nextInt();
		}
		
		dp = new long[k+1][2];
		
		for(int i=0; i<dp.length; i++)
			Arrays.fill(dp[i], -1);
		
		
		
		System.out.println(solve(k, 0)==0?"First":"Second");
	
	}
	
	private static long solve(int kLeft, int f) {
		if (kLeft<0) return f;
		
		if (dp[kLeft][f]!=-1) return dp[kLeft][f];
		
		for(int i=0; i<n; i++) {
			long winner = solve(kLeft-a[i], 1-f);
			if (winner==f) return dp[kLeft][f]=f;
		}
		
		return dp[kLeft][f]=1-f;
		
	}

}
