#include <bits/stdc++.h>
using namespace std;
int N, K, cnt = 0;
string S[100007];
int Trie[100007][27];
void Tin(string s) {
  int u = 0, j;
  for (auto i : s) {
    j = i - 'a';
    if (!Trie[u][j]) Trie[u][j] = ++cnt;
    u = Trie[u][j];
  }
}
pair<int, int> DFS(int u) {
  bool leaf = 1;
  pair<int, int> now, ret = make_pair(0, 0);
  for (int i = 0; i < 26; i++) {
    if (!Trie[u][i]) continue;
    leaf = 0;
    now = DFS(Trie[u][i]);
    if (!now.first) ret.first = 1;
    if (!now.second) ret.second = 1;
  }
  if (leaf) return make_pair(0, 1);
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  bool F;
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    cin >> S[i];
    Tin(S[i]);
  }
  pair<int, int> ans = DFS(0);
  if ((ans.first && ans.second) || (ans.first && !ans.second && K & 1))
    F = 1;
  else
    F = 0;
  if (F)
    cout << "First\n";
  else
    cout << "Second\n";
}
