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.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
namespace AtCoder
{
    class Program
    {
        static public int[] Sarray() { return ReadLine().Split().Select(int.Parse).ToArray(); }
        static public List<int> Slist() { return ReadLine().Split().Select(int.Parse).ToList(); }

        static int[] A;
        static int[] numtype;
        static readonly int WIN = 1;
        static readonly int UNJ = 0;
        static readonly int LOSE = -1;
        static void Main(string[] args)
        {
            var NK = Sarray();
            var N = NK[0];
            var K = NK[1];
            A = Sarray();
            var amax = A.Max();
            var amin = A.Min();

            numtype = new int[K + 1];
            for (var i = 0; i <= K; ++i)
                numtype[i] = isWinnerNum(i);
            if (WIN == numtype[K])
                WriteLine("First");
            else
                WriteLine("Second");
        }
        //負け数に持っていけたら勝ち
        static int isWinnerNum(int i)
        {
            if (numtype[i] != UNJ) return numtype[i];
            foreach (var a in A)
            {
                if (0 <= i - a)
                {
                    numtype[i - a] = isLoserNum(i - a);
                    if (LOSE == numtype[i - a])
                        return WIN;
                }
            }
            return LOSE;
        }
        //どう頑張っても勝ち数になるなら負け
        static int isLoserNum(int i)
        {
            if (numtype[i] != UNJ) return numtype[i];
            foreach (var a in A)
            {
                if (0 <= i - a)
                {
                    numtype[i - a] = isWinnerNum(i - a);
                    if (LOSE == numtype[i - a])
                        return WIN;
                }
            }
            return LOSE;
        }
    }
}