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: Wrong Answer)

import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int size = scanner.nextInt();
        int N = scanner.nextInt();
        int arr[] = new int[size];
        for (int i = 0; i < size; i++) {
            arr[i] = scanner.nextInt();

        }
        System.out.println((getWinner(arr, N) == 1 ? "second" : "first"));

    }

    public static int getWinner(int arr[], int N) {
        Arrays.sort(arr);
        int index = 0;
        int ans[][] = new int[N + 1][2];
        for (int i = 0; i < ans.length; i++) {
            if (i == 0) {
                ans[0][0] = 1;
                ans[1][0] = 0;
                continue;
            }
            if (index < arr.length && i == arr[index]) {
                ans[i][0] = 0;

                ans[i][1] = 1;
                index++;
                continue;

            }

            for (int j = 0; j < 2; j++) {

                ans[i][j] = -1;

            }
        }

        for (int i = 0; i < ans.length; i++) {

            for (int j = 0; j < 2; j++) {
                index = 0;
                int tempAns = -1;
                int o = j == 1 ? 0 : 1;
                ans[i][j] = o;
                while (index < arr.length && i - arr[index] >= 0) {
                    tempAns = ans[i - arr[index]][o];
                    if (tempAns == j) {
                        ans[i][j] = j;
                        break;
                    }
                    index++;
                }

            }
        }

       
        return ans[ans.length - 1][0];

    }
}