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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author aakas
 */
import java.util.*;
public class Main {
    static int n,k;
    static int[] arr;
    static boolean[][] v;
    static int[][] dp;
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        k = sc.nextInt();
        n = sc.nextInt();
        arr = new int[k+1];
        v = new boolean[n+1][2];
        dp = new int[n+1][2];
        for(int i=0;i<k;i++)
            arr[i] = sc.nextInt();
        if(s(n,0)==0)
            System.out.println("First");
        else
            System.out.println("Second");
    }
    public static int s(int n,int player)
    {
        //System.out.println(n+" "+player);
        if(n<0)
            return player;
        if(v[n][player])
            return dp[n][player];
        v[n][player] = true;
        //System.out.println(n+" "+player+" come here");
        for(int i=0;i<k;i++)
        {
            int temp = s(n-arr[i],1-player);
            if(s(n-arr[i],1-player) == player)
            {
                System.out.println("dp["+n+"]["+player+"] = "+(player));
                return dp[n][player]=player;
            }
        }
        System.out.println("dp["+n+"]["+player+"] = "+(1-player));
        return dp[n][player] = 1-player;
    }
}