
  
  int main(){
    int n,k;
  cin>>n>>k;
  ll a[n+1];
  //ll m=1000000000;
  for(int i=1;i<=n;i++){
    cin>>a[i];
   // m=min(a[i],m);
  }
  ll win[k+1][3];
  for(ll i=0;i<=k;i++)
  {
    win[i][1]=-1;
    win[i][2]=-1;
  }
  win[k][1]=0;
  win[k][2]=1;
  int x=2;
  for(ll i=k;i>=0;i-=1)
  {
    for(int j=1;j<=n;j++)
    {
      if(a[j]<=i&&win[i][1]!=-1&&win[i][2]!=-1)
      {
        win[i-a[j]][1]=win[i][2];
        win[i-a[j]][2]=win[i][1];
        if(win[i-a[j]][1]==1)
          x=1;
        else
          x=2;
      }
    }
  }
  if(x==1)cout<<"first";
  else
    cout<<"second";
  return 0;
}