import javax.swing.event.InternalFrameListener;
import java.io.*;
import java.text.*;
import java.util.*;

public class Main {

    static InputReader sc = new InputReader(System.in);
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) throws IOException {
        solver s = new solver();
        int t = 1;
        while (t > 0) {
            s.solve();
            t--;
        }
        out.close();
    }

    static class InputReader {

        public BufferedReader br;
        public StringTokenizer token;

        public InputReader(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream), 32768);
            token = null;
        }

        public String sn() {
            while (token == null || !token.hasMoreTokens()) {
                try {
                    token = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return token.nextToken();
        }

        public int ni() {
            return Integer.parseInt(sn());
        }

        public String snl() throws IOException {
            return br.readLine();
        }

        public long nlo() {
            return Long.parseLong(sn());
        }

        public double nd() {
            return Double.parseDouble(sn());
        }

        public int[] na(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = sc.ni();
            return a;
        }

        public long[] nal(int n) {
            long a[] = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = sc.nlo();
            return a;
        }
    }

    static int inf = 5000013;

    static class solver {
        DecimalFormat df = new DecimalFormat("0.00000000");
        long maxi = Integer.MAX_VALUE;
        long mod = (long) (1e9 + 7);
        int dp[];
        int n, k, a[];

        int grundy(int x) {
            if (dp[x] != -1)
                return dp[x];
            HashSet<Integer> map = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int t = x - a[i];
                if (t >= 0)
                    map.add(grundy(t));
            }
            dp[x] = 0;
            while (map.contains(dp[x]))
                dp[x]++;
            return dp[x];
        }

        void solve() {
            n = sc.ni();
            k = sc.ni();
            dp = new int[k + 1];
            Arrays.fill(dp, -1);
            a = sc.na(n);
            for (int i = 0; i <= k; i++)
                grundy(i);
            int ans = dp[k];
            if (ans == 0)
                out.println("Second");
            else
                out.println("First");
        }
    }
}
