#include <bits/stdc++.h>
using namespace std;
int ts, kk = 1;
template <class T>
inline T _sq(T a) {
  return a * a;
}
template <class T, class X>
inline T _pow(T a, X y) {
  T z = 1;
  for (int i = 1; i <= y; i++) {
    z *= a;
  }
  return z;
}
template <class T>
inline T _gcd(T a, T b) {
  a = _abs(a);
  b = _abs(b);
  if (!b) return a;
  return _gcd(b, a % b);
}
template <class T>
inline T _lcm(T a, T b) {
  a = _abs(a);
  b = _abs(b);
  return (a / _gcd(a, b)) * b;
}
template <class T>
inline T _extended(T a, T b, T &x, T &y) {
  a = _abs(a);
  b = _abs(b);
  T g, x1, y1;
  if (!b) {
    x = 1;
    y = 0;
    g = a;
    return g;
  }
  g = _extended(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
template <class T, class X>
inline T togglebit(T a, X i) {
  T t = 1;
  return (a ^ (t << i));
}
template <class T, class X, class Y>
inline T _bigmod(T n, X m, Y mod) {
  unsigned long long ret = 1, a = n % mod;
  while (m) {
    if (m & 1) ret = (ret * a) % mod;
    m >>= 1;
    a = (a * a) % mod;
  }
  ret %= mod;
  return (T)ret;
}
template <class T, class Y>
inline T _modinv(T n, Y mod) {
  return _bigmod(n, mod - 2, mod);
}
struct DT {
  int next[30];
} node[(100010 + 20)];
char str[(100010 + 20)];
int store[(100010 + 20)];
bool dp(int id) {
  if (store[id] != -1) {
    return store[id];
  }
  bool ret = false;
  for (int i = 0; i <= 25; i++) {
    if (node[id].next[i] != -1) {
      ret |= !dp(node[id].next[i]);
      if (ret) break;
    }
  }
  store[id] = ret;
  return ret;
}
bool dpdp(int id) {
  if (store[id] != -1) {
    return store[id];
  }
  bool ret = false;
  int p = 0;
  for (int i = 0; i <= 25; i++) {
    if (node[id].next[i] != -1) {
      ret |= !dpdp(node[id].next[i]);
      p++;
    }
  }
  if (p == 0) ret = true;
  store[id] = ret;
  return ret;
}
int main() {
  int n, k;
  cin >> n >> k;
  memset(node, -1, sizeof node);
  int idx = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%s", &str);
    int id = 0;
    int len = strlen(str);
    for (int j = 0; j <= len - 1; j++) {
      if (node[id].next[str[j] - 'a'] == -1) {
        node[id].next[str[j] - 'a'] = idx++;
      }
      id = node[id].next[str[j] - 'a'];
    }
  }
  memset(store, -1, sizeof store);
  bool win = dp(0);
  memset(store, -1, sizeof store);
  bool lose = dpdp(0);
  if (win && lose)
    cout << "First" << endl;
  else if (win) {
    if (k & 1)
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}
