#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, Mod = 1e9 + 7, Lg = 27, P = 727, Sq = 350;
const long long Inf = 3e18 + 10;
int W[N], Los[N], Ch[N][26], Cnt = 2, n, k;
string s[N];
void Insert(int id, int h, int cur) {
  if (h > (int)s[cur].size()) {
    return;
  }
  int sw = (s[cur][h - 1] - 'a');
  if (!Ch[id][sw]) {
    Ch[id][sw] = Cnt++;
  }
  Insert(Ch[id][sw], h + 1, cur);
}
void Find(int id) {
  bool sw = false;
  for (int i = 0; i < 26; i++) {
    if (Ch[id][i]) {
      Find(Ch[id][i]);
      W[id] |= (!W[Ch[id][i]]);
      Los[id] |= (!Los[Ch[id][i]]);
      sw = true;
    }
  }
  if (!sw) {
    W[id] = 0, Los[id] = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    Insert(1, 1, i);
  }
  Find(1);
  if (!W[1]) {
    cout << "Second";
    return 0;
  }
  if (Los[1]) {
    cout << "First";
    return 0;
  }
  if (k % 2) {
    cout << "First";
    return 0;
  }
  cout << "Second";
  return 0;
}
