#include <bits/stdc++.h>
using namespace std;
const long long int inf = 2222222222222222222LL;
const long long int mod = 1000000007LL;
long long int n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
long long int dx[9] = {0, 1, -1, 0, 0, 1, 1, -1, -1},
              dy[9] = {0, 0, 0, 1, -1, 1, -1, 1, -1};
long long int dp[222222][2], a[111];
long long int dfs(long long int cur) {
  if (dp[m]) return dp[m][cur % 2];
  if (m < a[0]) return cur + 1;
  long long int ret = cur + 1;
  for (long long int i = (long long int)(0LL); i < (long long int)(n); i++) {
    long long int x;
    m -= a[i];
    x = dfs(cur + 1);
    m += a[i];
    if (x % 2 == cur % 2) ret = cur;
  }
  return dp[m][cur % 2] = ret;
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (long long int i = (long long int)(0LL); i < (long long int)(n); i++)
    cin >> a[i];
  ans = dfs(1);
  if (ans % 2)
    cout << "First" << '\n';
  else
    cout << "Second" << '\n';
  return 0;
}
