#include <bits/stdc++.h>
using namespace std;
vector<unsigned long long> v;
set<unsigned long long> s;
multiset<unsigned long long> ms;
unsigned long long prime[10000000];
void boost() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
vector<unsigned long long> visited(10000000, 0);
vector<unsigned long long> adj[100000];
struct node {
  unsigned long long data;
  node *left;
  node *right;
};
node *getNode(unsigned long long val) {
  node *newNode = new node();
  newNode->data = val;
  newNode->left = newNode->right = NULL;
  return newNode;
}
node *findNode(node *root, unsigned long long data) {
  if (root->data == data) return root;
  if (root->left) findNode(root->left, data);
  if (root->right) findNode(root->right, data);
}
void display(node *root) {
  queue<node *> Q;
  Q.push(root);
  while (!Q.empty()) {
    node *x = Q.front();
    Q.pop();
    if (x->left) Q.push(x->left);
    if (x->right) Q.push(x->right);
    cout << x->data << " ";
  }
  cout << endl;
}
node *copy(node *root) {
  if (!root) return root;
  node *temp = new node();
  temp->data = root->data;
  temp->left = copy(root->left);
  temp->right = copy(root->right);
  return temp;
}
void mirror(node *root) {
  if (root) {
    mirror(root->left);
    mirror(root->right);
    node *temp = root->left;
    root->left = root->right;
    root->right = temp;
  }
  return;
}
int findMirror(int target, node *left, node *right) {
  if (left == NULL || right == NULL) return 0;
  if (left->data == target) return right->data;
  if (right->data == target) return left->data;
  int mirrorValue = findMirror(target, left->left, right->right);
  if (mirrorValue) return mirrorValue;
  return findMirror(target, left->right, right->left);
}
unsigned long long ncrmodp(unsigned long long num, unsigned long long r,
                           unsigned long long mod) {
  unsigned long long C[r + 1];
  unsigned long long i, j;
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (i = 1; i <= num; i++) {
    for (j = min(i, r); j > 0; j--) {
      C[j] = ((C[j]) % mod + (C[j - 1]) % mod) % mod;
    }
  }
  return C[r];
}
unsigned long long multiply(unsigned long long n, unsigned long long m) {
  unsigned long long prod = 1;
  for (int i = 0; i < (n); i++) {
    prod *= v[i];
    prod = prod % m;
  }
  return prod;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
unsigned long long power(
    unsigned long long x, unsigned long long y,
    unsigned long long pair<unsigned long long, unsigned long long>) {
  unsigned long long res = 1;
  x = x % pair<unsigned long long, unsigned long long>;
  while (y > 0) {
    if (y & 1) res = (res * x) % pair<unsigned long long, unsigned long long>;
    y = y >> 1;
    x = (x * x) % pair<unsigned long long, unsigned long long>;
  }
  return res;
}
void dfs(int k) {
  visited[k] = 1;
  for (int i = 0; i < adj[k].size(); ++i) {
    if (visited[adj[k][i]] == 0) {
      dfs(adj[k][i]);
    }
  }
}
void sieve(unsigned long long ending) {
  for (int i = 2; i < ending; i++) prime[i] = 1;
  for (int i = 2; i * i <= ending; i++) {
    if (prime[i] == 1) {
      for (int j = 2 * i; j <= ending; j = j + i) {
        prime[j] = 0;
      }
    }
  }
  prime[1] = 0;
}
unsigned long long mex(set<unsigned long long> s) {
  unsigned long long me = 0;
  while (s.find(me) != s.end()) me++;
  return me;
}
unsigned long long k, n;
unsigned long long dp[100005] = {0};
void grundy() {
  unsigned long long j = v[0], l, i;
  for (i = 0; i < j; i++) dp[i] = 0;
  for (i = j; i <= k; i++) {
    set<unsigned long long> s;
    for (l = 0; l < n; l++) {
      if (i - v[l] < 0)
        break;
      else
        s.insert(dp[i - v[l]]);
    }
    dp[i] = mex(s);
  }
}
int main() {
  boost();
  unsigned long long i, j;
  unsigned long long t, m;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    unsigned long long a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end());
  grundy();
  if (!dp[k])
    cout << "Second" << endl;
  else
    cout << "First" << endl;
  return 0;
}
