#include <bits/stdc++.h>
using namespace std;
bool trie[100001][26];
int vertex[100001][26];
int node_num = 1;
vector<int> a[100001];
void make_trie(const string& s, int node, int len) {
  if (len >= s.size()) {
    return;
  }
  int child = s[len] - 'a';
  if (!trie[node][child]) {
    trie[node][child] = true;
    vertex[node][child] = node_num;
    a[node].push_back(node_num);
    node_num++;
  }
  make_trie(s, vertex[node][child], len + 1);
}
bool canWin(int node) {
  bool isWin = false;
  for (int next : a[node]) {
    if (!canWin(next)) {
      isWin = true;
    }
  }
  return isWin;
}
bool canLose(int node) {
  bool isLose = false;
  for (int next : a[node]) {
    if (!canLose(next)) {
      isLose = true;
    }
  }
  if (a[node].size() <= 0) {
    isLose = true;
  }
  return isLose;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    make_trie(s, 0, 0);
  }
  bool can_win = canWin(0);
  bool can_lose = canLose(0);
  if (can_win && can_lose) {
    printf("First");
  } else if (!can_win && can_lose) {
    printf("Second");
  } else if (can_win && !can_lose) {
    printf("%s", (k % 2 == 1) ? "First" : "Second");
  } else if (!can_win && !can_lose) {
    printf("Second");
  }
  return 0;
}
