#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const int K = 1e5 + 5;
int n, k;
int dp[K];
vector<int> a;
set<int> s;
void grundy(int i) {
  if (i > k) return;
  cout << i << endl;
  for (int k = 0; k < n; k++)
    if (i - a[k] >= 0) {
      s.insert(dp[i - a[k]]);
    }
  if (s.size() == 0)
    dp[i] = 0;
  else {
    int m = 0;
    while (s.count(m)) m++;
    dp[i] = m;
  }
  s.clear();
  grundy(i + 1);
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int b;
    cin >> b;
    a.push_back(b);
  }
  sort(a.begin(), a.end());
  grundy(0);
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
