#include <iostream>

using namespace std;
const int K = 1e5+10;
int n, k;
int a[K], dp[K];

int main() 
{
  cin >> n >> k;
  memset(dp, 0, sizeof dp);
  for (int i = 0; i < n; i++) {
    scanf("%d", a[i]);
  }
  
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i >= a[j] && !dp[i-a[j]]) {
        dp[i] = 1;
        break;
      }
    }
  }
  
  cout << dp[k] ? "First" : "Second" << endl;
  
  return 0;
  
}
  

