#include <bits/stdc++.h>
using namespace std;
const int N = 101000, M = 26;
int ch[N][M], sz, n, k;
char s[N];
void my_insert(char* s) {
  int u = 0, l = strlen(s);
  for (int i = 0; i < l; u = ch[u][s[i++] - 'a']) {
    if (!ch[u][s[i] - 'a']) {
      ch[u][s[i] - 'a'] = ++sz;
    }
  }
}
int dfs(int x) {
  bool flag = true;
  int ans = 0;
  for (int i = 0; i < M; i++) {
    if (ch[x][i]) {
      flag = false;
      ans |= dfs(ch[x][i]) ^ 3;
    }
  }
  if (flag) {
    ans = 1;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> s;
    my_insert(s);
  }
  int t = dfs(0);
  cout << (((t == 3) || ((t > 1) && (k & 1))) ? "First" : "Second") << endl;
  return 0;
}
