#include <bits/stdc++.h>
using namespace std;
struct Node {
  int ch[26];
  int isStr;
  bool haveSon;
} trie[100005];
int size;
string str;
void insert() {
  cin >> str;
  int len = str.length();
  int now = 0;
  for (int i = 0; i < len; ++i) {
    trie[now].haveSon = 1;
    if (!trie[now].ch[str[i] - 'a']) {
      trie[now].ch[str[i] - 'a'] = ++size;
      now = size;
    } else
      now = trie[now].ch[str[i] - 'a'];
  }
  ++trie[now].isStr;
}
bool win[100005];
bool lose[100005];
int dfs1(int root) {
  if (!trie[root].haveSon)
    return win[root] = 0;
  else
    for (int i = 0; i < 26; ++i) {
      if (trie[root].ch[i] && !dfs1(trie[root].ch[i])) return win[root] = 1;
    }
  return win[root] = 0;
}
int dfs2(int root) {
  if (!trie[root].haveSon)
    return lose[root] = 1;
  else
    for (int i = 0; i < 26; ++i) {
      if (trie[root].ch[i] && !dfs2(trie[root].ch[i])) return lose[root] = 1;
    }
  return lose[root] = 0;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) insert();
  dfs1(0);
  dfs2(0);
  if (win[0]) {
    if (lose[0]) {
      printf("First");
    } else {
      if (k & 1)
        printf("First");
      else
        printf("Second");
    }
  } else {
    printf("Second");
  }
}
