#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 26 + 4;
int n, k, m, id[N][M];
bool mark[N][2];
void dfs(int u) {
  bool ok = true;
  for (int i = 0; i < M; i++)
    if (id[u][i]) {
      dfs(id[u][i]), ok = false;
      mark[u][0] |= !mark[id[u][i]][0];
      mark[u][1] |= !mark[id[u][i]][1];
    }
  mark[u][0] |= ok;
}
void build(string s) {
  int par = 0;
  for (auto c : s)
    if (!id[par][c - 'a'])
      par = id[par][c - 'a'] = ++m;
    else
      par = id[par][c - 'a'];
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    build(s);
  }
  dfs(0);
  if (mark[0][1] && (mark[0][0] || k & 1))
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
