#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>

using namespace std;

int main(){
  long long N, D;
  long long grundy = 0;

  cin >> N >> D;
  for(int i=0;i<N;i++){
    long long a;    
    cin >> a;
    grundy ^= ((a-1) % (D+1));
    //    cout << ((a-1) % (D+1)) << " " << bitset<8>(((a-1) % (D+1))) << endl;
  }
  if(grundy){
    cout << "First" << endl;
  }else{
    cout << "Second" << endl;
  }
  return 0;
}

