#include <bits/stdc++.h>
using namespace std;
int n, m, a[105];
int f[100005];
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; cin >> a[i++])
    ;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      if (i >= a[j]) f[i] = f[i - a[j]] ^ 1;
  cout << (f[m] == 1 ? "First\n" : "Second\n");
  return 0;
}
