#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long binexp(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    b /= 2;
    a = a * a % mod;
  }
  return ans;
}
long long inverse(long long a, long long p, long long mod) {
  return binexp(a, p - 2, mod);
}
void createadj(vector<vector<long long> > &adj, long long m) {
  long long x, y;
  for (int i = 0; i < (m); ++i) {
    cin >> x >> y;
    x--, y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
}
const long long mod = 1e9 + 7;
const int maxn = 1e5 + 5;
void pre() {}
int trie[maxn][26], nxt = 1;
vector<int> win;
vector<int> lose;
vector<int> vis;
void build(string s) {
  int v = 0;
  for (int i = 0; i < s.size(); ++i) {
    if (trie[v][s[i] - 'a'] == -1) {
      v = trie[v][s[i] - 'a'] = nxt++;
    } else {
      v = trie[v][s[i] - 'a'];
    }
  }
}
bool check(string s) {
  int v = 0;
  for (int i = 0; i < s.size(); ++i) {
    if (trie[v][s[i] - 'a'] == -1) return false;
    v = trie[v][s[i] - 'a'];
  }
  return true;
}
bool leaf(int v) {
  for (int i = 0; i < 26; ++i) {
    if (trie[v][i] != -1) return 0;
  }
  return 1;
}
void dfs(int v) {
  if (leaf(v)) {
    vis[v] = 1;
    win[v] = 0;
    lose[v] = 1;
    return;
  };
  vis[v] = 1;
  for (int i = 0; i < 26; ++i) {
    if (trie[v][i] != -1) {
      if (!vis[trie[v][i]]) {
        dfs(trie[v][i]);
      }
      win[v] |= !(win[trie[v][i]]);
      lose[v] |= !(lose[trie[v][i]]);
    }
  }
}
void solve() {
  memset(trie, -1, sizeof(trie));
  win = vector<int>(maxn, 0);
  lose = vector<int>(maxn, 0);
  vis = vector<int>(maxn, 0);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    build(s);
  }
  int f = 1;
  dfs(0);
  ;
  if (!win[0]) {
    f = 2;
  } else if (!lose[0]) {
    f = ((k + 1) % 2) + 1;
  } else {
    f = 1;
  }
  if (f == 1)
    cout << "First";
  else
    cout << "Second";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int TC = 1;
  pre();
  while (TC--) {
    solve();
    cout << "\n";
  }
  return 0;
}
