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;
class Program
{
	//static int[] dp;
	static void Main(string[] args)
	{
			// 入力フェーズ
			//int N = Int32.Parse(Console.ReadLine());
			string[] input = Console.ReadLine().Split(' '); // N,K
			int N = Int32.Parse(input[0]);
			int K = Int32.Parse(input[1]);

			// a1,a2,...aNを読み込む
			input = Console.ReadLine().Split(' ');
			int[] array = new int[N];
			for(int i=0; i<N; i++)
			{
				array[i] = Int32.Parse(input[i]);
			}

			int[] dp = new int[K+1]; // dpテーブル
			// i個石がある時に先手が勝てる場合は1, 負ける場合は0
			dp[0] = 0; // 初期値

			for(int i=0; i<=K; i++)
			{
				// 先手が負ける状態に出来れば＝後手になれれば勝てるから
				// 負け確定したところからajを配る
				if(dp[i] == 0)
				{
					for(int j=0; j<N; j++)
					{
						if(i+array[j]<=K)
						{
							// Kに収まることをチェック
							dp[i+array[j]] = 1;
						}
					}
				}
			}

			if(dp[K] == 0)
				Console.WriteLine("Second");
			else
				Console.WriteLine("First");
    }
}