#include <bits/stdc++.h>
namespace IO {
char buf[1 << 20 | 1], *f1 = buf, *f2 = buf, pbuf[1 << 24 | 1], *f3 = pbuf,
                       sta[100];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
template <class T>
inline void write(T x) {
  if (!x) return (void)(*f3++ = 48, *f3++ = ' ');
  if (x < 0) *f3++ = '-', x = ~x + 1;
  char *top = sta;
  while (x) *top++ = x % 10 + 48, x /= 10;
  while (top != sta) *f3++ = *--top;
  *f3++ = ' ';
}
inline void put(std::string s) {
  int len = s.length();
  for (int i = 0; i < len; i++) *f3++ = s[i];
  *f3++ = ' ';
}
inline void endline() { *f3++ = '\n'; }
template <class T>
inline T abs(T a) {
  return a < 0 ? -a : a;
}
template <class T>
inline T max(T a, T b) {
  return a > b ? a : b;
}
template <class T>
inline T min(T a, T b) {
  return a < b ? a : b;
}
template <class T>
inline void swap(T &a, T &b) {
  T t = a;
  a = b;
  b = t;
}
}  // namespace IO
using namespace IO;
const int N = 1e5 + 5;
int n, k, tr[N * 20][26], cnt, ans;
char s[N];
void insert() {
  int len = strlen(s + 1), p = 0;
  for (int i = 1; i <= len; i++) {
    int now = s[i] - 'a';
    if (!tr[p][now]) tr[p][now] = ++cnt;
    p = tr[p][now];
  }
}
int dfs(int x) {
  int flag = 1, ans = 0;
  for (int i = 0; i < 26; i++)
    if (tr[x][i]) {
      flag = 0;
      ans |= dfs(tr[x][i]);
    }
  ans ^= 3;
  if (flag) ans = 1;
  return ans;
}
int main() {
  n = read();
  k = read();
  for (int i = 1; i <= n; i++) scanf("%s", s + 1), insert();
  ans = dfs(0);
  if (!ans || ((k & 1) && (ans == 2)))
    puts("First");
  else
    puts("Second");
  return 0;
}
