Problem:
Score : 100 points

Problem Statement

There is a set A = \{ a_1, a_2, \ldots, a_N \} consisting of N positive integers.
Taro and Jiro will play the following game against each other.

Initially, we have a pile consisting of K stones.
The two players perform the following operation alternately, starting from Taro:

Choose an element x in A, and remove exactly x stones from the pile.

A player loses when he becomes unable to play.
Assuming that both players play optimally, determine the winner.

Constraints

All values in input are integers.

1 \leq N \leq 100

1 \leq K \leq 10^5

1 \leq a_1 < a_2 < \cdots < a_N \leq K

Input

Input is given from Standard Input in the following format:

N K
a_1 a_2 \ldots a_N

Output

If Taro will win, print First; if Jiro will win, print Second.

Sample Input 1

2 4
2 3

Sample Output 1

First

If Taro removes three stones, Jiro cannot make a move.
Thus, Taro wins.

Sample Input 2

2 5
2 3

Sample Output 2

Second

Whatever Taro does in his operation, Jiro wins, as follows:

If Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.

If Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.

Sample Input 3

2 7
2 3

Sample Output 3

First

Taro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:

If Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.

If Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.

Sample Input 4

3 20
1 2 3

Sample Output 4

Second

Sample Input 5

3 21
1 2 3

Sample Output 5

First

Sample Input 6

1 100000
1

Sample Output 6

Second

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
//Grundy numbers

public class Main{

	public static int grundy(int n,int dp[],int arr[])
	{
		if(n<=0)
			return 0;
		if(dp[n]!=-1) {
			//System.out.println("hi");
			return dp[n];}
		
		int c=0,ans=0;
		HashMap<Integer,Boolean> mp=new HashMap<>();
		for(int i=0;i<arr.length;i++)
		{
			if(n-arr[i]>=0) {
			if(dp[n-arr[i]]==-1)
			{
				dp[n-arr[i]]=grundy(n-arr[i],dp,arr);
			}
			if(!mp.containsKey(dp[n-arr[i]])) {
			mp.put(dp[n-arr[i]],true);
			}
			
		}}
		while(mp.containsKey(c))
		{c++;}
		
		//System.out.println(c);
		dp[n]=c;
		//System.out.println(n+" "+c);
		return c;
		
			}
	
	public static void main(String[] args) {
		
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int k=s.nextInt();
		int arr[]=new int[n];
		for(int i=0;i<n;i++)
		{
			arr[i]=s.nextInt();
		}
		
		int xor=0;
		int dp[]=new int[k];
		
		for(int i=0;i<arr[0];i++)
		{
			dp[i]=0;
		}
		for(int j=arr[0];j<(k);j++)
		{
			dp[j]=-1;
		}
		for(int i=0;i<n;i++)
		{
			int a=grundy(k-arr[i],dp,arr);
			
			xor=xor^a;
		}
		//System.out.println(xor);
		if(xor!=0)
			System.out.println("First");
		else
			System.out.println("Second");
	}

}