#include <bits/stdc++.h>
using namespace std;
int n, k;
char s[100003];
bool win[100003];
bool loose[100003];
int bor[100003][26];
int coun = 1;
void dfs(int x) {
  int i;
  bool leaf = true;
  for (i = 0; i < 26; i++)
    if (bor[x][i]) {
      dfs(bor[x][i]);
      win[x] |= (win[bor[x][i]] ^ 1);
      loose[x] |= (loose[bor[x][i]] ^ 1);
      leaf = false;
    }
  loose[x] |= leaf;
}
int main() {
  int i, j;
  scanf("%d %d", &n, &k);
  for (i = 0; i < n; i++) {
    scanf("%s", s);
    int start = 0;
    for (j = 0; s[j]; j++) {
      if (!bor[start][s[j] - 'a']) {
        bor[start][s[j] - 'a'] = coun;
        start = coun;
        coun++;
      } else
        start = bor[start][s[j] - 'a'];
    }
  }
  dfs(0);
  if (win[0] && loose[0]) {
    printf("First\n");
    return 0;
  }
  if (win[0] && !loose[0]) {
    if (k & 1)
      printf("First\n");
    else
      printf("Second\n");
    return 0;
  }
  printf("Second\n");
  return 0;
}
