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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

program Kstones;

const
  fi='kstone.inp';
  fo='kstone.out';

var
  a:array[1..100] of longint;
  f:array[0..100000] of 0..1;
  n,k: longint;

procedure nhap;
var i: longint;
begin

  readln(n,k);
  for i:=1 to n do read(a[i]);

end;

procedure xuli;
var i,j: longint;
begin

  fillchar(f,sizeof(f),0);

  for i:=1 to n do f[a[i]]:=1;

  for i:=1 to k do begin
    for j:=1 to n do begin
      if (i>a[j]) then begin
        if f[i-a[j]]=0 then f[i]:=1;
      end;
    end;
  end;

  if f[k]=0 then write('Second')
  else write('First');

end;

begin

  //assign(input,fi);     reset(input);
  //assign(output,fo);    rewrite(output);

  nhap;
  xuli;

  //close(input);         close(output);

end.