#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int Inf = 1e9 + 1;
const int Mod = 1e9 + 7;
int n, k, size;
string s;
struct node {
  int nxt[28];
  bool win, lose;
  node() { memset(nxt, 0, sizeof(nxt)); }
} t[N];
inline void add(string s) {
  int v = 0;
  for (int i = 0; i < s.size(); ++i) {
    int to = int(s[i] - 'a');
    if (!t[v].nxt[to]) t[v].nxt[to] = ++size;
    v = t[v].nxt[to];
  }
}
void dfs(int v = 0) {
  bool q = 0;
  for (int i = 0; i < 26; ++i) {
    int to = t[v].nxt[i];
    if (to) {
      q = 1, dfs(to);
      if (!t[to].win) t[v].win = 1;
      if (!t[to].lose) t[v].lose = 1;
    }
  }
  if (!q) t[v].lose = 1;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    cin >> s;
    add(s);
  }
  dfs();
  if (!t[0].win)
    cout << "Second";
  else if (t[0].win && t[0].lose)
    cout << "First";
  else {
    if (k % 2 == 0)
      cout << "Second";
    else
      cout << "First";
  }
  return 0;
}
