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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

public class S
{

    private const long DP_INIT_MINUS1 = -1;
    private const double DP_INIT_DOUBLE_MINUS1 = -1.0;
	private const long MOD = 1000000007;


    //s
    private const int FIRST_WIN = 1;
    private const int SECOND_WIN = 0;

    private static int[] dp;


    public static void Main()
	{
		/*
        var input = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        var N = input[0];
        var M = input[1];
        */

        var input = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        var N = input[0];
        var M = input[1];

        solver(N,M, Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse));
    }

    public static void solver(int N, int K, int[] plans){

        /*
            dp[K] 石K個でスタートした場合の勝ち負け

            2 3 での2~10

            F,F,F,S,S,

            例えば7のとき、2を選んだ場合は5を後手が先手始点で見た結果になる。
            5では後手が勝つ、つまり相手視点での敵、自分が勝てる。
            3を選ぶと4が残り、相手視点で自身が勝ち、つまり自分が負ける。
            

        
         */

        dp = new int[100010];

/*
        for(int i = 0; i <= K; i++){
            dp[i] = SECOND_WIN;
        }*/
        /*
        for(int i = min; i <= judgePoint + min; i++){
            dp[i] = FIRST_WIN;
        }
        */

        for(int i = 0; i <= K; i++){
            foreach(var tgt in plans){
                if(tgt > i) break;
                if(dp[i - tgt] == SECOND_WIN){
                    dp[i] = FIRST_WIN;
                    break;
                }
            }
        }

        Console.WriteLine(dp[K] == 1 ? "First" : "Second");
        


    }

}