#include <bits/stdc++.h>
using namespace std;
long long power(long long, long long);
long long mpower(long long, long long);
struct trie {
  trie* arr[26];
  long long sz = 0;
  long long win = 0;
  long long lose = 0;
  trie() {
    for (long long i = 0; i < 26; ++i) {
      arr[i] = NULL;
    }
  }
};
trie* t = new trie;
void insert(trie* t, string str) {
  long long id = 0;
  for (id = 0; id < str.size(); id++) {
    if (t->arr[str[id] - 'a'] == NULL) {
      t->sz++;
      t->arr[str[id] - 'a'] = new trie;
    }
    t = t->arr[str[id] - 'a'];
  }
}
void dfs(trie* t) {
  if (t->sz == 0) {
    t->lose = 1;
    return;
  }
  for (long long i = 0; i < 26; ++i) {
    if (t->arr[i] != NULL) {
      dfs(t->arr[i]);
      t->win |= !(t->arr[i]->win);
      t->lose |= !(t->arr[i]->lose);
    }
  }
}
long long n, k;
string str;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    string str;
    cin >> str;
    insert(t, str);
  }
  dfs(t);
  if (t->win == 0) {
    cout << "Second" << endl;
    return 0;
  }
  if (t->win and t->lose) {
    cout << "First" << endl;
    return 0;
  }
  if (t->win == 1 and t->lose == 0) {
    if (k % 2 == 1)
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  }
  return 0;
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b % 2 == 1) res = res * a;
    a = a * a;
    b = b / 2;
  }
  return res;
}
long long mpower(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % 1000000007;
    }
    a = (a * a) % 1000000007;
    b = b / 2;
  }
  return res;
}
