#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int trie[N][26], k, win[N], lose[N], n, m;
void insert(string key) {
  int u = 0;
  for (int i = 0; i <= key.length() - 1; i++) {
    int id = key[i] - 'a';
    if (!trie[u][id]) trie[u][id] = ++k;
    u = trie[u][id];
  }
}
void run(int t) {
  win[t] = lose[t] = false;
  bool ok = false;
  for (int i = 0; i <= 25; i++) {
    if (!trie[t][i]) continue;
    ok = true;
    int id = trie[t][i];
    run(id);
    win[t] = win[t] || (!win[id]);
    lose[t] = lose[t] || (!lose[id]);
  }
  if (!ok) lose[t] = true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m;
  while (n--) {
    string s;
    cin >> s;
    insert(s);
  }
  run(0);
  if (!win[0]) {
    cout << "Second";
    return 0;
  }
  if (lose[0] || (m % 2 == 1)) {
    cout << "First";
    return 0;
  }
  cout << "Second";
  return 0;
}
