#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[200020];
int main() {
    long long n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long f = 0, s = 0;
    sort(a, a + n);
    for (int i = n - 1; i >= 0; i--) {
        if ((n - i) % 2 == 1) {
            f += a[i] - 1;
        }
        else {
            s += a[i] - 1;
        }
    }
    f -= (n + 1) / 2 * m;
    s -= n / 2 * m;
    if (f > s) {
        cout << "First" << endl;
    }
    else {
        cout << "Second" << endl;
    }
    return 0;
}