#include <bits/stdc++.h>
using namespace std;
vector<int> s;
struct node {
  node *arr[26];
  bool win, lose;
  bool end = 0;
  node() {
    end = 1;
    for (int i = 0; i < 26; i++) arr[i] = NULL;
  }
  void update(char s[], int i, int n) {
    if (i == n) return;
    int ix = s[i] - 'a';
    if (arr[ix] == NULL) arr[ix] = new node;
    arr[ix]->update(s, i + 1, n);
    end = 0;
  }
  void ans(int from) {
    s.push_back(from);
    if (end) {
      win = 0;
      lose = 1;
    } else {
      win = lose = 0;
      for (int i = 0; i < 26; i++) {
        if (arr[i]) {
          arr[i]->ans(i);
          win |= !arr[i]->win;
          lose |= !arr[i]->lose;
        }
      }
    }
    s.pop_back();
  }
} trie;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  char s[112345];
  while (n--) {
    scanf("%s", &s);
    trie.update(s, 0, strlen(s));
  }
  trie.ans(27);
  if (trie.win && trie.lose)
    printf("First\n");
  else if (trie.win && !trie.lose) {
    if (m % 2)
      printf("First\n");
    else
      printf("Second\n");
  } else
    printf("Second\n");
}
