#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> s(n), dp(n + 1);
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i <= n; i++) {
    for (auto x : s) {
      if (i >= x && !dp[i - x]) dp[x] = 1;
    }
  }
  cout << (dp.back() ? "First" : "Second") << endl;
}
int main() {
  solve();
  return 0;
}
