#include <bits/stdc++.h>
using namespace std;
class KStone {
public:
string winner2D(vector<int>& stones, int n, int k) {
vector<vector<bool>> dp(k+1, vector<bool>(n+1, false));
// base cases
for (int j = 0; j <= n; j++)
dp[0][j] = false;
for (int i = 1; i <= k; i++)
dp[i][0] = false;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= n; j++) {
dp[i][j] = dp[i][j-1];
if (i >= stones[j-1] && dp[i - stones[j-1]][j] == false) {
dp[i][j] = true;
}
}
}
return dp[k][n] ? "first" : "second";
}
};
int main() {
int n, k;
cin >> n >> k;
vector<int> stones(n);
for(int i = 0; i < n; ++i) cin >> stones[i];
KStone obj;
cout << obj.winner2D(stones, n, k);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgpjbGFzcyBLU3RvbmUgewpwdWJsaWM6CglzdHJpbmcgd2lubmVyMkQodmVjdG9yPGludD4mIHN0b25lcywgaW50IG4sIGludCBrKSB7CgkgICAgdmVjdG9yPHZlY3Rvcjxib29sPj4gZHAoaysxLCB2ZWN0b3I8Ym9vbD4obisxLCBmYWxzZSkpOwoKCSAgICAvLyBiYXNlIGNhc2VzCgkgICAgZm9yIChpbnQgaiA9IDA7IGogPD0gbjsgaisrKQoJICAgICAgICBkcFswXVtqXSA9IGZhbHNlOwoJCgkgICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gazsgaSsrKQoJICAgICAgICBkcFtpXVswXSA9IGZhbHNlOwoJCgkgICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gazsgaSsrKSB7CgkgICAgICAgIGZvciAoaW50IGogPSAxOyBqIDw9IG47IGorKykgewoJICAgICAgICAgICAgZHBbaV1bal0gPSBkcFtpXVtqLTFdOwoJICAgICAgICAgICAgaWYgKGkgPj0gc3RvbmVzW2otMV0gJiYgZHBbaSAtIHN0b25lc1tqLTFdXVtqXSA9PSBmYWxzZSkgewoJICAgICAgICAgICAgICAgIGRwW2ldW2pdID0gdHJ1ZTsKCSAgICAgICAgICAgIH0KCSAgICAgICAgfQoJICAgIH0KCSAgICByZXR1cm4gZHBba11bbl0gPyAiZmlyc3QiIDogInNlY29uZCI7Cgl9Cgp9OwoKaW50IG1haW4oKSB7CglpbnQgbiwgazsKCWNpbiA+PiBuID4+IGs7CgoJdmVjdG9yPGludD4gc3RvbmVzKG4pOwoKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyArK2kpIGNpbiA+PiBzdG9uZXNbaV07CgkKCUtTdG9uZSBvYmo7Cgljb3V0IDw8IG9iai53aW5uZXIyRChzdG9uZXMsIG4sIGspOwoKCXJldHVybiAwOwp9