import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;


void main() {
    int n, k;
    scan(n, k);
    auto a = readln.split.to!(int[]);

    auto dp = new int[](k + 1);
    dp[0] = 0;

    // 0: 先手負け(=後手勝ち)、 1: 先手勝ち
    foreach (i ; 1 .. k + 1) {
        dp[i] = 0;
        foreach (ai ; a) {
            if (i - ai < 0) {
                break;
            }
            if (dp[i - ai] == 0) {
                dp[i] = 1;
                break;
            }
        }
    }

    debug {
        writeln(dp);
    }

    writeln(dp[k] ? "First" : "Second");
}





void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}