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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)


//package cf;
import java.io.*;
import java.util.*;
import java.util.concurrent.atomic.LongAdder;

public class Main {
    static int p=1000000007;
    public static void main(String[] args) throws Exception {
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(java.io.FileDescriptor.out), "ASCII"), 512);
        FastReader sc = new FastReader();
        // long k = sc.nextLong();
        int n = sc.nextInt();
        int k= sc.nextInt();
        StringBuilder sb = new StringBuilder();
        int ar[]=new int[n];
        int s=0,tot=0;
        for(int i=0;i<n;i++)
        {
            ar[i]=sc.nextInt();
        }
        Arrays.sort(ar);
        int dp[] = new int[k+1];
       // Arrays.fill(dp,-1);
        //dp[0]=0;
        for(int i=1;i<=k;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(i-ar[j]>=0&&dp[i-ar[j]]==0)
                {
                    dp[i]=1;
                    break;
                }
            }
        }
        System.out.println(dp[k]==1?"First":"Second");
//Arrays.fill(dp,-1);
        //System.out.println(dp(ar,n,k,dp));


    }
    public static int dp(int ar[],int n,int k,int dp[]) {
      //  System.out.println(k+" ");
        if(k<=0)
            return 0;
        if(dp[k]!=-1)
            return dp[k];

         for(int i=0;i<n;i++)
        {
            if(k-ar[i]<0)
                break;
            int ans=dp(ar,n,k-ar[i],dp);
            if(ans==0)
            {
             // System.out.println(k+" "+ar[i]);
                dp[k]=1;
                return dp[k]=1;
            }
        }
        dp[k]=0;
        return dp[k];
    }




    ///////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////////////////////
    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }


}