#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > v(1);
vector<vector<char> > to(1);
const int N = 2e5 + 10;
bool uw[N], ul[N], win[N], los[N];
bool can_win(int st) {
  if (uw[st]) return win[st];
  uw[st] = true;
  for (int i = 0; i < v[st].size(); ++i)
    if (!can_win(v[st][i])) return win[st] = true;
  return win[st] = false;
}
bool can_loose(int st) {
  if (ul[st]) return los[st];
  ul[st] = true;
  if (v[st].size() == 0) return los[st] = true;
  for (int i = 0; i < v[st].size(); ++i)
    if (!can_loose(v[st][i])) return los[st] = true;
  return los[st] = false;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  int cnt = 1;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    int cur = 0;
    for (int j = 0; j < s.length(); ++j) {
      bool T = false;
      for (int z = 0; z < v[cur].size(); ++z) {
        if (to[cur][z] == s[j]) {
          T = true;
          cur = v[cur][z];
          break;
        }
      }
      if (!T) {
        v[cur].push_back(cnt);
        v.resize(v.size() + 1);
        to[cur].push_back(s[j]);
        to.resize(to.size() + 1);
        cur = cnt++;
      }
    }
  }
  if (can_win(0)) {
    if (k % 2 == 1)
      cout << "First";
    else if (can_loose(0))
      cout << "First";
    else
      cout << "Second";
  } else
    cout << "Second";
  return 0;
}
