#include <bits/stdc++.h>
using namespace std;
template <typename A>
string to_string(A* ptr) {
  stringstream ss;
  ss << "0x" << std::setw(16) << std::setfill('0') << std::hex
     << (uint64_t)(uintptr_t)ptr;
  return ss.str();
}
string to_string(char c) { return ((string) "'" + c) + "'"; }
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const int ALPHA = 26;
const int ROOT = 0;
const int NIL = -1;
struct Node {
  int child[ALPHA];
  Node() {
    for (int c = 0; c < ALPHA; c++) child[c] = NIL;
  }
};
int to_int(char c) { return c - 'a'; }
struct Trie {
  vector<Node> A;
  Trie() : A(1) {}
  void insert(const string& s) {
    int curr = ROOT;
    for (char c : s) {
      int cc = to_int(c);
      if (A[curr].child[cc] == NIL) {
        A[curr].child[cc] = (int)A.size();
        A.push_back({});
      }
      curr = A[curr].child[cc];
    }
  }
  bool firstForceWin(int curr) {
    assert(curr != NIL);
    bool haveMoves = false;
    for (int c = 0; c < ALPHA; c++) {
      if (A[curr].child[c] != NIL) haveMoves = true;
    }
    if (!haveMoves) return false;
    for (int c = 0; c < ALPHA; c++) {
      if (A[curr].child[c] != NIL && !firstForceWin(A[curr].child[c]))
        return true;
    }
    return false;
  }
  bool firstForceLoss(int curr) {
    assert(curr != NIL);
    bool haveMoves = false;
    for (int c = 0; c < ALPHA; c++) {
      if (A[curr].child[c] != NIL) haveMoves = true;
    }
    if (!haveMoves) return true;
    for (int c = 0; c < ALPHA; c++) {
      if (A[curr].child[c] != NIL && !firstForceLoss(A[curr].child[c]))
        return true;
    }
    return false;
  }
};
int n, k;
const int MX = 1e5 + 99;
string s[MX];
bool FirstWins() {
  Trie T;
  for (int i = 0; i < n; i++) {
    T.insert(s[i]);
  }
  bool firstForceWin = T.firstForceWin(ROOT);
  bool firstForceLoss = T.firstForceLoss(ROOT);
  42;
  42;
  42;
  if (!firstForceWin && !firstForceLoss) return false;
  if (!firstForceWin && firstForceLoss) return false;
  if (firstForceWin && !firstForceLoss) return k % 2 == 1;
  if (firstForceWin && firstForceLoss) return true;
  assert(false);
  return true;
}
int main() {
  int TTT = 1;
  for (int ttt = 0; ttt < TTT; ttt++) {
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> s[i];
    cout << (FirstWins() ? "First" : "Second") << '\n';
  }
  return 0;
}
