Light Yagami is once again playing games with the detective L. This time, L has invited Light to a fancy restaurant and has brought 3 piles of canned potato chips to the table; unknowingly, this happens to be one of Light's favorite snacks. While waiting for their order, the detective offers a game: Light and L will alternate between taking chips, where each person can take some number of chips $$$1 \leq c_i \leq p_i$$$ from one of the piles i (where $$$p_i$$$ is the number of chips in pile i), or take some number of chips $$$1 \leq c_i \leq \min\{p_i\}$$$ (where $$$\min\{p_i\}$$$ is the minimum amount of chips across all piles) from all three of the piles. Being a gentleman, L offers Light to go first. Is it possible for Light to take the last chip if both play optimally?