#include <bits/stdc++.h>
using namespace std;
int di[] = {1, -1, 0, 0};
int dj[] = {0, 0, 1, -1};
bool dp[(int)1e5 + 1];
int N;
int K;
int main() {
  cin >> N >> K;
  vector<int> stones(N);
  for (int i = 0; i < N; i++) cin >> stones[i];
  dp[0] = false;
  for (int i = 1; i <= N; i++) {
    bool res = false;
    for (int stone : stones) {
      if (i - stone >= 0 && !dp[i - stone]) res = true;
    }
    dp[i] = res;
  }
  if (dp[N])
    cout << "First";
  else
    cout << "Second";
}
