#include <bits/stdc++.h>
using namespace std;
const double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcounll(s);
}
template <class T>
T sqr(T x) {
  return x * x;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int trie[MAXN][26], n, k, w[MAXN], cntNode, f[MAXN];
string s;
void update(string s) {
  int node = 0;
  for (int i = 0; i < ((int)(s).size()); i++) {
    int cur = s[i] - 'a';
    if (trie[node][cur] == 0) {
      trie[node][cur] = ++cntNode;
    }
    node = trie[node][cur];
  }
}
void dfs(int u) {
  int check = 0;
  for (int i = 0; i < 26; i++) {
    if (trie[u][i]) {
      dfs(trie[u][i]);
      check = 1;
    }
  }
  if (!check) {
    w[u] = 1;
    return;
  }
  w[u] = 0;
  for (int i = 0; i < 26; i++) {
    if (trie[u][i]) {
      if (!w[trie[u][i]]) w[u] = 1;
    }
  }
}
void dfs1(int u) {
  int check = 0;
  for (int i = 0; i < 26; i++) {
    if (trie[u][i]) {
      dfs1(trie[u][i]);
      check = 1;
    }
  }
  if (!check) {
    f[u] = 0;
    return;
  }
  f[u] = 0;
  for (int i = 0; i < 26; i++) {
    if (trie[u][i]) {
      if (!f[trie[u][i]]) f[u] = 1;
    }
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> s;
    update(s);
  }
  dfs(0);
  dfs1(0);
  if (w[0]) {
    if (f[0])
      cout << "First";
    else
      cout << "Second";
  } else {
    if (f[0]) {
      if (k % 2)
        cout << "First";
      else
        cout << "Second";
    } else {
      cout << "Second";
    }
  }
}
